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 03:58Josu 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 03:59041,719,41430,997,0001,072,0002,113,536expected "53685774514683430 ", got "53685992400387273 "
2May 11, 2026 03:59041,962,08631,262,0001,064,0002,113,536expected "53680773240463272 ", got "53680773205152169 "
3May 11, 2026 03:593,87040,329,12731,051,0001,072,0002,113,536
4May 11, 2026 03:593,87540,668,94631,099,0001,067,0002,113,536
5May 11, 2026 03:593,87841,727,86631,109,0001,079,0002,113,536
6May 11, 2026 03:593,88542,961,68831,180,0001,071,0002,113,536
7May 11, 2026 03:593,88741,295,71631,178,0001,085,0002,113,536
8May 11, 2026 03:593,89642,109,19831,200,0001,141,0002,113,536
9May 11, 2026 03:593,94740,414,86131,666,0001,098,0002,113,536