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 listApr 20, 2026 22:14Josu San MartinJosu San MartinScore: 5,104Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 22:144,98861,491,65340,396,0001,009,0002,375,680
2Apr 20, 2026 22:145,06665,112,77840,054,0002,002,0002,277,376
3Apr 20, 2026 22:145,08461,337,71940,192,0002,009,0002,265,088
4Apr 20, 2026 22:145,10362,200,59641,350,0001,008,0002,375,680
5Apr 20, 2026 22:145,10465,112,08741,359,0001,008,0002,379,776
6Apr 20, 2026 22:145,11563,140,69141,445,0001,010,0002,379,776
7Apr 20, 2026 22:145,23058,974,56142,402,0001,009,0002,404,352
8Apr 20, 2026 22:145,28768,110,52641,892,0001,994,0002,379,776
9Apr 20, 2026 22:145,49976,360,29344,631,0001,014,0002,433,024