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 19, 2026 13:09Victor MerckléVictor MerckléScore: 5,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 13:105,85557,329,08447,569,0001,029,0002,113,536
2May 19, 2026 13:105,86458,239,45547,660,0001,019,0002,113,536
3May 19, 2026 13:105,86557,361,75147,650,0001,030,0002,113,536
4May 19, 2026 13:105,86559,290,79347,654,0001,026,0002,113,536
5May 19, 2026 13:105,86756,445,66947,692,0001,010,0002,113,536
6May 19, 2026 13:105,86956,644,97147,699,0001,015,0002,113,536
7May 19, 2026 13:105,91459,854,43248,054,0001,036,0002,113,536
8May 19, 2026 13:105,99957,533,64048,766,0001,027,0002,113,536
9May 19, 2026 13:106,00659,839,57948,827,0001,024,0002,113,536