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 29, 2026 17:40Victor 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 29, 2026 17:403,84040,225,31330,810,0001,064,0002,117,632stderr
2Aug 29, 2026 17:403,84740,279,57630,802,0001,134,0002,117,632stderr
3Aug 29, 2026 17:403,85440,361,79530,848,0001,142,0002,117,632stderr
4Aug 29, 2026 17:403,85440,155,20230,872,0001,120,0002,117,632stderr
5Aug 29, 2026 17:403,86440,456,57730,942,0001,137,0002,117,632stderr
6Aug 29, 2026 17:403,86741,570,05930,962,0001,137,0002,117,632stderr
7Aug 29, 2026 17:403,86841,164,32430,967,0001,141,0002,117,632stderr
8Aug 29, 2026 17:403,87040,557,77430,998,0001,126,0002,117,632stderr
9Aug 29, 2026 17:403,89640,734,90531,219,0001,125,0002,117,632stderr