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 15:43Josu San MartinJosu San MartinScore: 4,003Success
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 15:433,99441,840,83632,092,0001,061,0002,113,536
2May 10, 2026 15:433,99942,775,79832,141,0001,054,0002,113,536
3May 10, 2026 15:434,00143,420,57432,147,0001,064,0002,113,536
4May 10, 2026 15:434,00243,198,76632,158,0001,061,0002,113,536
5May 10, 2026 15:434,00342,882,25132,174,0001,059,0002,113,536
6May 10, 2026 15:434,00540,740,29732,160,0001,083,0002,113,536
7May 10, 2026 15:434,01443,509,65832,262,0001,057,0002,113,536
8May 10, 2026 15:434,01543,590,23732,255,0001,073,0002,113,536
9May 10, 2026 15:434,04343,000,01432,494,0001,064,0002,113,536