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 12, 2026 00:56Victor MerckléVictor MerckléScore: 3,813Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 00:573,76339,654,85230,091,0001,144,0002,117,632stderr
2Aug 12, 2026 00:573,76739,706,23430,111,0001,162,0002,117,632stderr
3Aug 12, 2026 00:573,79939,966,98330,453,0001,086,0002,117,632stderr
4Aug 12, 2026 00:573,80539,970,81630,455,0001,127,0002,117,632stderr
5Aug 12, 2026 00:573,81340,096,50330,514,0001,136,0002,117,632stderr
6Aug 12, 2026 00:573,83640,245,01130,760,0001,081,0002,117,632stderr
7Aug 12, 2026 00:573,84940,451,23430,854,0001,096,0002,117,632stderr
8Aug 12, 2026 00:573,85042,147,39830,754,0001,207,0002,117,632stderr
9Aug 12, 2026 00:573,96541,368,96431,850,0001,066,0002,117,632stderr