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 18:58Victor MerckléVictor MerckléScore: 40,212Success
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 19:0240,136342,281,382332,031,0001,101,0002,117,632stderr
2Sep 8, 2026 19:0240,185342,293,715332,447,0001,096,0002,117,632stderr
3Sep 8, 2026 19:0240,205342,856,209332,636,0001,073,0002,117,632stderr
4Sep 8, 2026 19:0240,211342,987,157332,693,0001,064,0002,117,632stderr
5Sep 8, 2026 19:0240,212342,333,728332,669,0001,095,0002,117,632stderr
6Sep 8, 2026 19:0240,249342,722,251332,969,0001,098,0002,117,632stderr
7Sep 8, 2026 19:0240,285342,902,846333,287,0001,079,0002,117,632stderr
8Sep 8, 2026 19:0240,300343,645,948333,387,0001,104,0002,117,632stderr
9Sep 8, 2026 19:0242,364369,181,818350,550,0001,078,0002,117,632stderr