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 12, 2026 14:09Victor MerckléVictor MerckléScore: 3,771Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 14:103,74239,552,13029,924,0001,139,0002,117,632stderr
2Aug 12, 2026 14:103,74339,539,88429,917,0001,151,0002,117,632stderr
3Aug 12, 2026 14:103,76239,664,85930,140,0001,086,0002,117,632stderr
4Aug 12, 2026 14:103,76240,619,54730,126,0001,105,0002,117,632stderr
5Aug 12, 2026 14:103,77139,712,27930,223,0001,077,0002,117,632stderr
6Aug 12, 2026 14:103,77439,714,22430,233,0001,093,0002,117,632stderr
7Aug 12, 2026 14:103,78639,833,59430,292,0001,140,0002,117,632stderr
8Aug 12, 2026 14:103,79539,898,90630,425,0001,079,0002,117,632stderr
9Aug 12, 2026 14:103,81540,106,52230,580,0001,087,0002,117,632stderr