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 21:34Victor MerckléVictor MerckléScore: 35,397Success
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 21:3835,273301,805,801291,650,0001,120,0002,117,632stderr
2Sep 8, 2026 21:3835,324302,459,295292,063,0001,128,0002,117,632stderr
3Sep 8, 2026 21:3835,388302,845,163292,596,0001,132,0002,117,632stderr
4Sep 8, 2026 21:3835,394302,366,463292,761,0001,011,0002,117,632stderr
5Sep 8, 2026 21:3835,397302,919,083292,765,0001,035,0002,117,632stderr
6Sep 8, 2026 21:3835,401302,931,923292,707,0001,128,0002,117,632stderr
7Sep 8, 2026 21:3835,418303,116,958292,961,0001,012,0002,117,632stderr
8Sep 8, 2026 21:3835,434302,744,914292,968,0001,139,0002,117,632stderr
9Sep 8, 2026 21:3835,478302,899,732293,410,0001,060,0002,117,632stderr