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 listAug 12, 2026 02:54Victor MerckléVictor MerckléScore: 6,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 02:556,12159,264,81649,784,0001,027,0002,117,632stderr
2Aug 12, 2026 02:556,12859,225,39749,832,0001,036,0002,117,632stderr
3Aug 12, 2026 02:556,12959,290,91749,849,0001,027,0002,117,632stderr
4Aug 12, 2026 02:556,15359,516,04450,048,0001,030,0002,117,632stderr
5Aug 12, 2026 02:556,22460,119,27950,556,0001,104,0002,117,632stderr
6Aug 12, 2026 02:556,23161,452,74750,692,0001,031,0002,117,632stderr
7Aug 12, 2026 02:556,30660,782,88751,299,0001,044,0002,117,632stderr
8Aug 12, 2026 02:556,38161,342,67251,921,0001,049,0002,117,632stderr
9Aug 12, 2026 02:556,48162,229,16352,758,0001,038,0002,117,632stderr