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 listMay 11, 2026 00:38Josu San MartinJosu San MartinScore: 4,345Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 00:394,33244,190,06234,900,0001,061,0002,113,536
2May 11, 2026 00:394,33745,613,84034,939,0001,061,0002,113,536
3May 11, 2026 00:394,34145,030,57034,974,0001,063,0002,113,536
4May 11, 2026 00:394,34545,659,25535,023,0001,042,0002,113,536
5May 11, 2026 00:394,34545,490,49535,002,0001,065,0002,113,536
6May 11, 2026 00:394,35044,417,47335,047,0001,058,0002,113,536
7May 11, 2026 00:394,36943,923,08135,192,0001,071,0002,113,536
8May 11, 2026 00:394,37546,642,53735,204,0001,115,0002,113,536
9May 11, 2026 00:394,40146,093,20135,464,0001,067,0002,113,536