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:38Josu 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:38040,899,84232,466,0001,072,0002,113,536expected "53688672710263312 ", got "53688672404593331 "
2May 10, 2026 19:384,02540,712,94032,344,0001,064,0002,113,536
3May 10, 2026 19:384,03840,798,31432,439,0001,081,0002,113,536
4May 10, 2026 19:384,04042,202,95632,462,0001,072,0002,113,536
5May 10, 2026 19:384,04543,088,64532,492,0001,089,0002,113,536
6May 10, 2026 19:384,04942,639,79932,547,0001,067,0002,113,536
7May 10, 2026 19:384,05543,800,54632,573,0001,086,0002,113,536
8May 10, 2026 19:384,05943,998,32032,626,0001,068,0002,113,536
9May 10, 2026 19:384,06642,486,82332,688,0001,066,0002,113,536