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 listAug 25, 2026 00:40Victor MerckléVictor MerckléScore: 7,058Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 00:416,97166,229,69856,852,0001,010,0002,117,632stderr
2Aug 25, 2026 00:416,98066,444,15256,834,0001,102,0002,117,632stderr
3Aug 25, 2026 00:417,02566,694,10657,206,0001,103,0002,117,632stderr
4Aug 25, 2026 00:417,03366,832,07057,250,0001,132,0002,117,632stderr
5Aug 25, 2026 00:417,05867,062,87857,447,0001,139,0002,117,632stderr
6Aug 25, 2026 00:417,06266,988,01857,504,0001,115,0002,117,632stderr
7Aug 25, 2026 00:417,08267,219,82757,651,0001,137,0002,117,632stderr
8Aug 25, 2026 00:417,08967,294,61157,696,0001,150,0002,117,632stderr
9Aug 25, 2026 00:417,23068,388,46458,923,0001,088,0002,117,632stderr