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:46Victor MerckléVictor MerckléScore: 7,097Success
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:477,05166,989,87157,395,0001,132,0002,117,632stderr
2Aug 25, 2026 00:477,06767,025,62957,578,0001,086,0002,117,632stderr
3Aug 25, 2026 00:477,06867,191,43257,524,0001,143,0002,117,632stderr
4Aug 25, 2026 00:477,07567,105,83657,592,0001,136,0002,117,632stderr
5Aug 25, 2026 00:477,09767,302,59357,792,0001,121,0002,117,632stderr
6Aug 25, 2026 00:477,16267,892,94158,326,0001,124,0002,117,632stderr
7Aug 25, 2026 00:477,17768,667,38558,417,0001,154,0002,117,632stderr
8Aug 25, 2026 00:477,17869,177,31758,492,0001,092,0002,117,632stderr
9Aug 25, 2026 00:477,19068,042,65158,600,0001,084,0002,117,632stderr