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 listMay 10, 2026 19:37Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 19:37041,752,10431,611,0001,069,0002,113,536expected "53687475372206168 ", got "53687475116206168 "
2May 10, 2026 19:37041,450,33030,950,0001,066,0002,113,536expected "53692196301352807 ", got "53692196045352807 "
3May 10, 2026 19:373,83441,123,22730,788,0001,041,0002,113,536
4May 10, 2026 19:373,84341,103,17330,866,0001,034,0002,113,536
5May 10, 2026 19:373,86041,552,38230,999,0001,045,0002,113,536
6May 10, 2026 19:373,86941,481,33031,005,0001,109,0002,113,536
7May 10, 2026 19:373,87539,439,40331,093,0001,076,0002,113,536
8May 10, 2026 19:373,90541,256,11431,344,0001,068,0002,113,536
9May 10, 2026 19:373,93942,673,06531,612,0001,085,0002,113,536