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 19, 2026 07:06wnwnScore: 3,575Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 07:063,54554,507,05228,407,0001,014,0002,277,376
2Apr 19, 2026 07:063,54650,321,77128,420,0001,015,0002,494,464
3Apr 19, 2026 07:063,56559,027,80328,567,0001,020,0002,490,368
4Apr 19, 2026 07:063,56756,411,20928,588,0001,021,0002,277,376
5Apr 19, 2026 07:063,57553,198,57728,652,0001,023,0002,277,376
6Apr 19, 2026 07:063,57651,209,70128,658,0001,023,0002,498,560
7Apr 19, 2026 07:063,66954,381,26829,440,0001,015,0002,494,464
8Apr 19, 2026 07:063,72652,129,43028,933,0001,995,0002,277,376
9Apr 19, 2026 07:063,74055,802,26929,039,0002,002,0002,527,232