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 27, 2026 22:34lipapipalipapipaScore: 5,837Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 27, 2026 22:355,61170,375,92646,570,00002,285,568
2Feb 27, 2026 22:355,61569,097,24246,605,00002,285,568
3Feb 27, 2026 22:355,83567,164,29948,428,00002,400,256
4Feb 27, 2026 22:355,83774,917,96548,449,00002,285,568
5Feb 27, 2026 22:355,88775,605,96247,863,000997,0002,408,448
6Feb 27, 2026 22:356,03775,726,31148,103,0002,004,0002,285,568