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 23, 2026 20:02Victor MerckléVictor MerckléScore: 3,762Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 20:033,73339,229,58329,869,0001,122,0002,117,632stderr
2Aug 23, 2026 20:033,75539,504,50630,076,0001,091,0002,117,632stderr
3Aug 23, 2026 20:033,75639,583,04230,064,0001,118,0002,117,632stderr
4Aug 23, 2026 20:033,76244,492,40930,110,0001,122,0002,117,632stderr
5Aug 23, 2026 20:033,76239,573,59330,143,0001,084,0002,117,632stderr
6Aug 23, 2026 20:033,76640,327,11930,134,0001,125,0002,117,632stderr
7Aug 23, 2026 20:033,76639,671,52930,142,0001,123,0002,117,632stderr
8Aug 23, 2026 20:033,77339,711,25430,250,0001,070,0002,117,632stderr
9Aug 23, 2026 20:033,78539,766,15030,301,0001,122,0002,117,632stderr