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 listFeb 5, 2026 04:05Josu San MartinJosu San MartinScore: 6,252Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 04:056,00074,307,68747,809,0001,992,0002,281,472
2Feb 5, 2026 04:056,12282,092,21549,817,000996,0002,437,120
3Feb 5, 2026 04:056,15273,451,64549,057,0002,002,0002,285,568
4Feb 5, 2026 04:056,25278,313,11049,898,0001,995,0002,285,568
5Feb 5, 2026 04:056,26379,256,95149,981,0001,999,0002,281,472
6Feb 5, 2026 04:056,27877,451,09550,107,0002,004,0002,531,328