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 listJan 2, 2026 22:12Josu San MartinJosu San MartinScore: 6,123Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 22:125,76281,641,14147,824,00002,404,352
2Jan 2, 2026 22:125,88673,697,69246,858,0001,993,0002,285,568
3Jan 2, 2026 22:126,03075,435,43148,044,0002,001,0002,277,376
4Jan 2, 2026 22:126,12379,661,24349,826,000996,0002,285,568
5Jan 2, 2026 22:126,19375,378,44451,406,00002,285,568
6Jan 2, 2026 22:126,19776,112,20750,425,0001,008,0002,392,064