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 13:53Victor MerckléVictor MerckléScore: 3,787Success
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 13:533,76639,612,20830,167,0001,092,0002,117,632stderr
2Aug 12, 2026 13:533,77039,678,99530,155,0001,141,0002,117,632stderr
3Aug 12, 2026 13:533,77339,671,98030,201,0001,115,0002,117,632stderr
4Aug 12, 2026 13:533,77739,745,88230,170,0001,181,0002,117,632stderr
5Aug 12, 2026 13:533,78739,868,70630,346,0001,091,0002,117,632stderr
6Aug 12, 2026 13:533,79339,858,28530,383,0001,103,0002,117,632stderr
7Aug 12, 2026 13:533,79740,672,12830,430,0001,090,0002,117,632stderr
8Aug 12, 2026 13:533,81840,157,55130,616,0001,080,0002,117,632stderr
9Aug 12, 2026 13:533,82740,188,15730,680,0001,090,0002,117,632stderr