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 20:59Victor MerckléVictor MerckléScore: 3,864Success
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 21:003,82640,775,21330,636,0001,121,0002,117,632stderr
2Aug 11, 2026 21:003,84640,330,88130,888,0001,038,0002,117,632stderr
3Aug 11, 2026 21:003,85640,410,54530,861,0001,151,0002,117,632stderr
4Aug 11, 2026 21:003,86440,519,36030,906,0001,169,0002,117,632stderr
5Aug 11, 2026 21:003,86440,443,45131,046,0001,028,0002,117,632stderr
6Aug 11, 2026 21:003,88240,592,00531,088,0001,136,0002,117,632stderr
7Aug 11, 2026 21:003,93641,090,03331,547,0001,127,0002,117,632stderr
8Aug 11, 2026 21:004,07142,201,66032,735,0001,056,0002,117,632stderr
9Aug 11, 2026 21:004,12142,575,56633,164,0001,041,0002,117,632stderr