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 12:13Victor MerckléVictor MerckléScore: 5,342Success
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 12:174,87548,949,71529,862,00010,604,0002,117,632stderr
2Sep 8, 2026 12:174,92350,256,86929,469,00011,399,0002,117,632stderr
3Sep 8, 2026 12:175,17752,134,06528,614,00014,356,00024,576stderr
4Sep 8, 2026 12:175,25552,819,13328,608,00015,009,00024,576stderr
5Sep 8, 2026 12:175,34252,871,18029,063,00015,278,00024,576stderr
6Sep 8, 2026 12:175,52354,786,85728,698,00017,147,0002,117,632stderr
7Sep 8, 2026 12:175,59154,868,94428,990,00017,417,0002,117,632stderr
8Sep 8, 2026 12:175,59654,891,97028,833,00017,619,0002,117,632stderr
9Sep 8, 2026 12:175,64455,320,23629,589,00017,263,0002,117,632stderr