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 02:12Andrew EpsteinAndrew EpsteinScore: 145,915Success
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 02:12145,7101,219,614,4661,208,397,0001,003,0002,117,632stderr
2Sep 17, 2026 02:12145,7151,219,664,5541,208,440,0001,002,0002,117,632stderr
3Sep 17, 2026 02:12145,7651,220,119,7471,208,850,0001,001,0002,117,632stderr
4Sep 17, 2026 02:12145,8711,221,043,5421,209,729,0001,006,0002,117,632stderr
5Sep 17, 2026 02:12145,9151,221,404,3021,209,088,0002,008,0002,117,632stderr
6Sep 17, 2026 02:12146,0411,222,461,5511,211,135,0001,006,0002,117,632stderr
7Sep 17, 2026 02:12146,0901,222,859,8671,211,540,0001,008,0002,117,632stderr
8Sep 17, 2026 02:12146,1191,223,713,7441,210,639,0002,149,0002,117,632stderr
9Sep 17, 2026 02:12146,2161,223,875,2371,212,592,0001,002,0002,117,632stderr