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:33Victor MerckléVictor MerckléScore: 3,850Success
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:333,83840,235,01730,552,0001,307,0002,117,632stderr
2Aug 25, 2026 00:333,84040,226,92530,648,0001,225,0002,117,632stderr
3Aug 25, 2026 00:333,84540,319,15230,732,0001,188,0002,117,632stderr
4Aug 25, 2026 00:333,84740,343,26730,917,0001,020,0002,117,632stderr
5Aug 25, 2026 00:333,85040,374,75030,769,0001,194,0002,117,632stderr
6Aug 25, 2026 00:333,85640,416,77030,844,0001,169,0002,117,632stderr
7Aug 25, 2026 00:333,86140,489,47330,853,0001,194,0002,117,632stderr
8Aug 25, 2026 00:333,86940,495,48930,885,0001,230,0002,117,632stderr
9Aug 25, 2026 00:333,91740,893,61631,476,0001,042,0002,117,632stderr