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 listSep 5, 2026 23:15Kevin HeaveyKevin HeaveyScore: 4,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 23:164,86050,185,08939,318,0001,023,0002,113,536
2Sep 5, 2026 23:164,87550,240,85739,445,0001,025,0002,113,536
3Sep 5, 2026 23:164,90950,634,96239,729,0001,023,0002,113,536
4Sep 5, 2026 23:164,91450,635,10639,767,0001,023,0002,113,536
5Sep 5, 2026 23:164,95150,950,40040,070,0001,024,0002,113,536
6Sep 5, 2026 23:165,14052,574,65941,644,0001,023,0002,113,536
7Sep 5, 2026 23:165,19052,929,98442,057,0001,022,0002,113,536
8Sep 5, 2026 23:165,19752,916,55342,119,0001,022,0002,113,536
9Sep 5, 2026 23:165,22653,222,31642,359,0001,023,0002,113,536