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:31Victor MerckléVictor MerckléScore: 3,826Success
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:343,73639,586,76429,922,0001,090,0002,117,632stderr
2Sep 8, 2026 19:343,79340,664,92730,364,0001,122,0002,117,632stderr
3Sep 8, 2026 19:343,79640,014,83530,413,0001,097,0002,117,632stderr
4Sep 8, 2026 19:343,82440,969,68030,699,0001,043,0002,117,632stderr
5Sep 8, 2026 19:343,82640,139,57030,674,0001,086,0002,117,632stderr
6Sep 8, 2026 19:343,82740,451,06030,632,0001,138,0002,117,632stderr
7Sep 8, 2026 19:343,82740,949,35530,720,0001,045,0002,117,632stderr
8Sep 8, 2026 19:343,82740,924,33230,629,0001,137,0002,117,632stderr
9Sep 8, 2026 19:343,84040,151,68230,770,0001,107,0002,117,632stderr