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 13:50Andrew EpsteinAndrew EpsteinScore: 11,142Success
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 14:0611,057100,516,93790,716,0001,060,0002,117,632stderr
2Sep 17, 2026 14:0611,058100,608,32590,725,0001,058,0002,117,632stderr
3Sep 17, 2026 14:0611,092100,785,10791,001,0001,063,0002,117,632stderr
4Sep 17, 2026 14:0611,115100,971,41391,210,0001,050,0002,117,632stderr
5Sep 17, 2026 14:0611,142101,268,13191,433,0001,048,0002,117,632stderr
6Sep 17, 2026 14:0611,160101,356,28391,611,0001,025,0002,117,632stderr
7Sep 17, 2026 14:0611,164101,437,99391,597,0001,069,0002,117,632stderr
8Sep 17, 2026 14:0611,170101,454,83591,668,0001,049,0002,117,632stderr
9Sep 17, 2026 14:0611,173103,436,64791,610,0001,127,0002,117,632stderr