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 listJul 2, 2026 02:20Victor MerckléVictor MerckléScore: 4,185Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 02:224,16142,276,23133,453,0001,090,0002,117,632stderr
2Jul 2, 2026 02:224,16842,378,55133,487,0001,111,0002,117,632stderr
3Jul 2, 2026 02:224,17443,485,27033,511,0001,138,0002,117,632stderr
4Jul 2, 2026 02:224,18042,721,63833,649,0001,047,0002,117,632stderr
5Jul 2, 2026 02:224,18542,478,17933,714,0001,025,0002,117,632stderr
6Jul 2, 2026 02:224,19543,030,97833,691,0001,132,0002,117,632stderr
7Jul 2, 2026 02:224,20042,619,33133,737,0001,125,0002,117,632stderr
8Jul 2, 2026 02:224,34443,864,20534,950,0001,109,0002,117,632stderr
9Jul 2, 2026 02:224,48745,167,96036,180,0001,063,0002,117,632stderr