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 13, 2026 19:14Victor MerckléVictor MerckléScore: 3,544Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2026 19:183,49138,788,51127,860,0001,117,0002,117,632stderr
2Sep 13, 2026 19:183,49339,733,10727,859,0001,133,0002,117,632stderr
3Sep 13, 2026 19:183,51039,530,69128,001,0001,140,0002,117,632stderr
4Sep 13, 2026 19:183,52339,736,37328,126,0001,118,0002,117,632stderr
5Sep 13, 2026 19:183,54439,340,98928,292,0001,131,0002,117,632stderr
6Sep 13, 2026 19:183,57439,503,70628,525,0001,147,0002,117,632stderr
7Sep 13, 2026 19:183,59440,358,50028,695,0001,137,0002,117,632stderr
8Sep 13, 2026 19:183,60739,815,24928,809,0001,135,0002,117,632stderr
9Sep 13, 2026 19:183,90052,751,44331,124,0001,247,0002,117,632stderr