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 03:18Victor MerckléVictor MerckléScore: 3,792Success
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 03:193,75239,605,25929,972,0001,170,0002,117,632stderr
2Aug 12, 2026 03:193,76139,677,96430,092,0001,130,0002,117,632stderr
3Aug 12, 2026 03:193,77339,723,47830,240,0001,082,0002,117,632stderr
4Aug 12, 2026 03:193,78339,819,13330,305,0001,100,0002,117,632stderr
5Aug 12, 2026 03:193,79240,130,77930,313,0001,167,0002,117,632stderr
6Aug 12, 2026 03:193,79340,006,53030,401,0001,083,0002,117,632stderr
7Aug 12, 2026 03:193,80439,990,19030,298,0001,278,0002,117,632stderr
8Aug 12, 2026 03:193,84040,272,61630,780,0001,099,0002,117,632stderr
9Aug 12, 2026 03:193,89040,723,55031,171,0001,123,0002,117,632stderr