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 26, 2026 20:48Victor MerckléVictor MerckléScore: 7,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 20:497,02266,851,08557,136,0001,153,0002,117,632stderr
2Aug 26, 2026 20:497,08567,176,78157,673,0001,140,0002,117,632stderr
3Aug 26, 2026 20:497,08667,836,50757,604,0001,213,0002,117,632stderr
4Aug 26, 2026 20:497,10067,109,44057,851,0001,086,0002,117,632stderr
5Aug 26, 2026 20:497,11967,391,47657,871,0001,217,0002,117,632stderr
6Aug 26, 2026 20:497,12268,162,82057,957,0001,160,0002,117,632stderr
7Aug 26, 2026 20:497,13168,252,86558,002,0001,192,0002,117,632stderr
8Aug 26, 2026 20:497,16568,532,55158,320,0001,150,0002,117,632stderr
9Aug 26, 2026 20:497,17567,886,61358,480,0001,076,0002,117,632stderr