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 21, 2026 15:05boop34boop34Score: 8,223Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 15:058,16377,010,33566,636,0001,123,0002,117,632
2Sep 21, 2026 15:058,20177,611,87566,943,0001,127,0002,117,632
3Sep 21, 2026 15:058,20577,703,50367,001,0001,105,0002,117,632
4Sep 21, 2026 15:058,21477,242,15167,065,0001,119,0002,117,632
5Sep 21, 2026 15:058,22377,824,94667,150,0001,106,0002,117,632
6Sep 21, 2026 15:058,23077,157,37867,175,0001,135,0002,117,632
7Sep 21, 2026 15:058,24177,296,84667,288,0001,117,0002,117,632
8Sep 21, 2026 15:058,27077,567,16067,454,0001,189,0002,117,632
9Sep 21, 2026 15:058,30377,806,69767,882,0001,037,0002,117,632