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 4, 2026 10:01Victor MerckléVictor MerckléScore: 3,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 10:023,62138,446,81128,909,0001,150,0002,117,632stderr
2Sep 4, 2026 10:023,64438,667,92129,118,0001,133,0002,117,632stderr
3Sep 4, 2026 10:023,65438,742,68629,181,0001,153,0002,117,632stderr
4Sep 4, 2026 10:023,65538,736,04629,180,0001,164,0002,117,632stderr
5Sep 4, 2026 10:023,65939,412,51229,209,0001,167,0002,117,632stderr
6Sep 4, 2026 10:023,68238,972,01529,457,0001,111,0002,117,632stderr
7Sep 4, 2026 10:023,68739,013,81129,455,0001,148,0002,117,632stderr
8Sep 4, 2026 10:023,69439,130,21729,519,0001,143,0002,117,632stderr
9Sep 4, 2026 10:023,71739,246,06629,620,0001,233,0002,117,632stderr