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 14, 2026 12:00Victor MerckléVictor MerckléScore: 47,087Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 12:0346,887399,740,952388,042,0001,126,0002,117,632stderr
2Sep 14, 2026 12:0347,010399,993,365389,069,0001,118,0002,117,632stderr
3Sep 14, 2026 12:0347,024400,207,711389,132,0001,168,0002,117,632stderr
4Sep 14, 2026 12:0347,033401,679,196389,332,0001,048,0002,117,632stderr
5Sep 14, 2026 12:0347,087400,800,002389,825,0001,003,0002,117,632stderr
6Sep 14, 2026 12:0347,104400,808,788389,895,0001,071,0002,117,632stderr
7Sep 14, 2026 12:0347,122401,018,382389,945,0001,175,0002,117,632stderr
8Sep 14, 2026 12:0347,125401,622,731389,989,0001,156,0002,117,632stderr
9Sep 14, 2026 12:0347,182402,160,096390,445,0001,166,0002,117,632stderr