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 11, 2026 01:57Josu 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 11, 2026 01:58040,051,98431,243,0001,089,0002,113,536expected "53688487234355368 ", got "53688486722355368 "
2May 11, 2026 01:583,87040,571,97731,059,0001,066,0002,113,536
3May 11, 2026 01:583,89040,044,63631,205,0001,089,0002,113,536
4May 11, 2026 01:583,89140,955,94831,222,0001,081,0002,113,536
5May 11, 2026 01:583,89540,066,81831,235,0001,098,0002,113,536
6May 11, 2026 01:583,94642,259,57331,665,0001,093,0002,113,536
7May 11, 2026 01:583,95141,832,50831,727,0001,069,0002,113,536
8May 11, 2026 01:583,95641,127,65031,752,0001,091,0002,113,536
9May 11, 2026 01:583,97040,674,89031,861,0001,091,0002,113,536