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:15Josu San MartinJosu San MartinScore: 3,869Success
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:153,85842,559,58430,944,0001,078,0002,113,536
2May 10, 2026 19:153,86340,456,59030,995,0001,076,0002,113,536
3May 10, 2026 19:153,86642,241,89031,009,0001,079,0002,113,536
4May 10, 2026 19:153,86840,433,42231,047,0001,064,0002,113,536
5May 10, 2026 19:153,86943,105,09131,032,0001,083,0002,113,536
6May 10, 2026 19:153,87440,242,93331,074,0001,081,0002,113,536
7May 10, 2026 19:153,87540,313,04331,077,0001,092,0002,113,536
8May 10, 2026 19:153,89643,107,74231,275,0001,067,0002,113,536
9May 10, 2026 19:157,26568,158,73259,188,0001,119,0002,113,536