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 11, 2026 13:39Victor MerckléVictor MerckléScore: 63,776Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 13:3963,464535,545,709525,663,0001,095,0002,117,632stderr
2Aug 11, 2026 13:3963,478535,104,257525,783,0001,086,0002,117,632stderr
3Aug 11, 2026 13:3963,493535,250,185525,892,0001,105,0002,117,632stderr
4Aug 11, 2026 13:3963,495535,368,480525,923,0001,086,0002,117,632stderr
5Aug 11, 2026 13:3963,776538,415,913528,344,0001,003,0002,117,632stderr
6Aug 11, 2026 13:3964,046540,007,845530,579,0001,007,0002,117,632stderr
7Aug 11, 2026 13:3964,129540,582,964531,220,0001,056,0002,117,632stderr
8Aug 11, 2026 13:3964,298542,005,372532,650,0001,024,0002,117,632stderr
9Aug 11, 2026 13:3964,385543,419,079533,287,0001,114,0002,117,632stderr