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 listSep 8, 2026 22:12Victor MerckléVictor MerckléScore: 30,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 22:1630,623262,725,668253,057,0001,117,0002,117,632stderr
2Sep 8, 2026 22:1630,682263,239,777253,559,0001,107,0002,117,632stderr
3Sep 8, 2026 22:1630,707264,287,284253,745,0001,128,0002,117,632stderr
4Sep 8, 2026 22:1630,736263,675,251254,114,0001,003,0002,117,632stderr
5Sep 8, 2026 22:1630,746263,785,413254,037,0001,162,0002,117,632stderr
6Sep 8, 2026 22:1630,753264,467,394254,123,0001,133,0002,117,632stderr
7Sep 8, 2026 22:1630,838264,565,170254,829,0001,132,0002,117,632stderr
8Sep 8, 2026 22:1630,844264,589,946254,867,0001,141,0002,117,632stderr
9Sep 8, 2026 22:1630,863264,855,370255,051,0001,120,0002,117,632stderr