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 15:05Victor MerckléVictor MerckléScore: 3,781Success
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 15:063,75539,316,63430,034,0001,136,0002,117,632stderr
2Aug 12, 2026 15:063,75639,527,26430,066,0001,114,0002,117,632stderr
3Aug 12, 2026 15:063,77039,683,29130,193,0001,105,0002,117,632stderr
4Aug 12, 2026 15:063,77639,795,40630,276,0001,070,0002,117,632stderr
5Aug 12, 2026 15:063,78139,850,59330,311,0001,079,0002,117,632stderr
6Aug 12, 2026 15:063,78639,914,66430,321,0001,107,0002,117,632stderr
7Aug 12, 2026 15:063,79239,893,54130,399,0001,080,0002,117,632stderr
8Aug 12, 2026 15:063,79339,869,46230,368,0001,119,0002,117,632stderr
9Aug 12, 2026 15:063,79739,914,98230,383,0001,135,0002,117,632stderr