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 1, 2026 10:12Victor MerckléVictor MerckléScore: 11,267Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 10:1311,261108,454,97392,467,0001,005,0002,383,872
2May 1, 2026 10:1311,262112,336,24692,471,0001,005,0002,318,336
3May 1, 2026 10:1311,266110,402,14392,505,0001,005,0002,379,776
4May 1, 2026 10:1311,266110,077,03392,504,0001,005,0002,375,680
5May 1, 2026 10:1311,267111,753,28092,519,0001,005,0002,383,872
6May 1, 2026 10:1311,274112,442,03692,574,0001,006,0002,371,584
7May 1, 2026 10:1311,277109,106,16592,600,0001,006,0002,379,776
8May 1, 2026 10:1311,278112,958,95292,605,0001,006,0002,379,776
9May 1, 2026 10:1311,281109,532,49792,633,0001,006,0002,379,776