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 20:23Victor MerckléVictor MerckléScore: 45,253Success
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 20:2745,095382,898,071373,191,0001,102,0002,117,632stderr
2Sep 8, 2026 20:2745,153383,240,953373,658,0001,118,0002,117,632stderr
3Sep 8, 2026 20:2745,211384,394,357374,126,0001,132,0002,117,632stderr
4Sep 8, 2026 20:2745,244384,764,152374,494,0001,036,0002,117,632stderr
5Sep 8, 2026 20:2745,253384,265,401374,518,0001,088,0002,117,632stderr
6Sep 8, 2026 20:2745,324385,324,581375,054,0001,138,0002,117,632stderr
7Sep 8, 2026 20:2745,339384,947,009375,163,0001,156,0002,117,632stderr
8Sep 8, 2026 20:2745,350384,953,246375,275,0001,136,0002,117,632stderr
9Sep 8, 2026 20:2745,459385,781,829376,157,0001,154,0002,117,632stderr