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 27, 2026 04:49wnwnScore: 3,498Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 04:503,39844,875,41327,197,0001,007,0002,486,272
2Apr 27, 2026 04:503,44546,404,87527,578,0001,021,0002,478,080
3Apr 27, 2026 04:503,45347,335,05527,645,0001,023,0002,478,080
4Apr 27, 2026 04:503,46341,792,18826,762,0001,982,0002,482,176
5Apr 27, 2026 04:503,49845,182,07727,039,0002,002,0002,330,624
6Apr 27, 2026 04:503,52850,770,20828,277,0001,009,0002,494,464
7Apr 27, 2026 04:503,55942,621,47728,528,0001,018,0002,486,272
8Apr 27, 2026 04:503,61046,130,89727,969,0001,997,0002,494,464
9Apr 27, 2026 04:503,66149,839,18530,394,00002,486,272