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 16, 2026 23:52Andrew EpsteinAndrew EpsteinScore: 258,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 23:53258,1132,152,556,4902,141,331,0001,009,0002,117,632stderr
2Sep 16, 2026 23:53258,3022,154,135,1472,141,877,0002,031,0002,117,632stderr
3Sep 16, 2026 23:53258,4282,155,289,5132,142,865,0002,090,0002,117,632stderr
4Sep 16, 2026 23:53258,5472,156,400,0332,143,935,0002,008,0002,117,632stderr
5Sep 16, 2026 23:53258,7912,158,880,8362,146,963,0001,005,0002,117,632stderr
6Sep 16, 2026 23:53258,8102,158,370,7872,146,111,0002,015,0002,117,632stderr
7Sep 16, 2026 23:53258,8192,166,807,5722,145,994,0002,210,0002,117,632stderr
8Sep 16, 2026 23:53258,8972,161,119,9992,146,828,0002,024,0002,117,632stderr
9Sep 16, 2026 23:53259,2432,162,587,3482,150,724,0001,000,0002,117,632stderr