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 listAug 20, 2026 22:10Andrew EpsteinAndrew EpsteinScore: 10,069Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 20, 2026 22:1110,00792,807,56582,052,0001,013,0002,113,536
2Aug 20, 2026 22:1110,01594,016,39582,129,0001,003,0002,113,536
3Aug 20, 2026 22:1110,02293,032,35682,175,0001,009,0002,113,536
4Aug 20, 2026 22:1110,03493,100,55882,271,0001,018,0002,113,536
5Aug 20, 2026 22:1110,06993,423,11482,553,0001,020,0002,113,536
6Aug 20, 2026 22:1110,08693,421,29982,706,0001,010,0002,113,536
7Aug 20, 2026 22:1110,09893,618,18582,802,0001,016,0002,113,536
8Aug 20, 2026 22:1110,13993,909,42283,149,0001,012,0002,113,536
9Aug 20, 2026 22:1110,14093,982,17483,135,0001,027,0002,113,536