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 14, 2026 02:12Victor MerckléVictor MerckléScore: 7,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 02:127,28470,092,15860,464,00002,113,536
2May 14, 2026 02:127,28768,172,60660,484,00002,113,536
3May 14, 2026 02:127,29069,391,57959,474,0001,040,0002,113,536
4May 14, 2026 02:127,29069,896,10859,473,0001,034,0002,113,536
5May 14, 2026 02:127,29169,719,11359,508,0001,009,0002,113,536
6May 14, 2026 02:127,29967,909,23059,539,0001,045,0002,113,536
7May 14, 2026 02:127,30069,472,80359,595,0001,003,0002,113,536
8May 14, 2026 02:127,35571,251,27660,047,0001,002,0002,113,536
9May 14, 2026 02:127,35568,290,17860,011,0001,041,0002,113,536