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 17, 2026 16:25Andrew EpsteinAndrew EpsteinScore: 147,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 16:33147,3621,233,349,2681,222,102,0001,003,0002,117,632stderr
2Sep 17, 2026 16:33147,4291,234,599,5851,221,555,0002,107,0002,117,632stderr
3Sep 17, 2026 16:33147,5021,234,519,0321,222,263,0002,005,0002,117,632stderr
4Sep 17, 2026 16:33147,5041,234,584,4941,223,283,0001,003,0002,117,632stderr
5Sep 17, 2026 16:33147,5361,234,750,9991,223,554,0001,001,0002,117,632stderr
6Sep 17, 2026 16:33147,5481,235,610,8681,222,497,0002,152,0002,117,632stderr
7Sep 17, 2026 16:33147,7461,236,749,5681,225,291,0001,004,0002,117,632stderr
8Sep 17, 2026 16:33147,7811,236,801,4601,225,584,0001,004,0002,117,632stderr
9Sep 17, 2026 16:33148,2911,243,854,8771,228,807,0002,009,0002,117,632stderr