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 12, 2026 03:23olliecrowolliecrowScore: 9,784Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2026 03:239,521111,050,41377,025,0002,000,0002,404,352
2Feb 12, 2026 03:239,568101,814,80078,409,0001,005,0002,408,448
3Feb 12, 2026 03:239,713106,504,67980,620,00002,301,952
4Feb 12, 2026 03:239,784107,383,74179,206,0002,005,0002,424,832
5Feb 12, 2026 03:239,848105,654,17280,742,000996,0002,265,088
6Feb 12, 2026 03:2310,131108,968,43282,088,0002,002,0002,510,848