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 19:18Victor MerckléVictor MerckléScore: 3,540Success
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:223,45437,373,50327,575,0001,094,0002,117,632stderr
2Sep 8, 2026 19:223,52337,763,56928,147,0001,094,0002,117,632stderr
3Sep 8, 2026 19:223,52738,447,06528,185,0001,093,0002,117,632stderr
4Sep 8, 2026 19:223,53537,996,54728,213,0001,135,0002,117,632stderr
5Sep 8, 2026 19:223,54038,593,82428,300,0001,090,0002,117,632stderr
6Sep 8, 2026 19:223,54438,241,50128,282,0001,137,0002,117,632stderr
7Sep 8, 2026 19:223,55938,084,11128,393,0001,149,0002,117,632stderr
8Sep 8, 2026 19:223,58138,341,52328,598,0001,125,0002,117,632stderr
9Sep 8, 2026 19:223,59838,547,03328,732,0001,135,0002,117,632stderr