Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJun 21, 2026 20:30A_ShamanA_ShamanScore: 68,603Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 20:3068,473577,726,865507,212,00061,118,0002,113,536
2Jun 21, 2026 20:3068,522577,838,034508,001,00060,732,0002,113,536
3Jun 21, 2026 20:3068,569578,672,388509,001,00060,128,0002,113,536
4Jun 21, 2026 20:3068,589578,614,420507,578,00061,713,0002,113,536
5Jun 21, 2026 20:3068,603578,822,296508,591,00060,819,0002,113,536
6Jun 21, 2026 20:3068,666579,020,557509,305,00060,631,0002,113,536
7Jun 21, 2026 20:3068,677579,333,289508,805,00061,218,0002,113,536
8Jun 21, 2026 20:3068,716579,518,076508,898,00061,448,0002,113,536
9Jun 21, 2026 20:3068,841580,550,486511,530,00059,853,0002,113,536