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 03:23Andrew EpsteinAndrew EpsteinScore: 138,993Success
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 03:24137,9901,155,876,5311,142,088,0003,230,0002,121,728stderr
2Sep 17, 2026 03:24138,6971,161,613,6081,148,092,0003,098,0002,117,632stderr
3Sep 17, 2026 03:24138,8021,162,491,6931,148,966,0003,092,0002,117,632stderr
4Sep 17, 2026 03:24138,9281,163,525,9591,150,000,0003,103,0002,117,632stderr
5Sep 17, 2026 03:24138,9931,163,995,4011,150,539,0003,106,0002,121,728stderr
6Sep 17, 2026 03:24139,2351,166,117,5351,152,480,0003,176,0002,121,728stderr
7Sep 17, 2026 03:24139,2661,166,496,2601,152,830,0003,084,0002,121,728stderr
8Sep 17, 2026 03:24139,3731,167,578,3101,153,615,0003,185,0002,121,728stderr
9Sep 17, 2026 03:24139,7901,171,337,8121,157,092,0003,170,0002,117,632stderr