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 listSep 1, 2026 06:47Victor MerckléVictor MerckléScore: 3,755Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 06:483,73839,459,08329,860,0001,168,0002,117,632stderr
2Sep 1, 2026 06:483,74139,462,77429,920,0001,135,0002,117,632stderr
3Sep 1, 2026 06:483,74439,455,71129,912,0001,164,0002,117,632stderr
4Sep 1, 2026 06:483,75339,547,81030,048,0001,109,0002,117,632stderr
5Sep 1, 2026 06:483,75539,538,68030,024,0001,146,0002,117,632stderr
6Sep 1, 2026 06:483,77040,351,75930,150,0001,141,0002,117,632stderr
7Sep 1, 2026 06:483,77139,676,74330,160,0001,147,0002,117,632stderr
8Sep 1, 2026 06:483,79339,871,28930,306,0001,177,0002,117,632stderr
9Sep 1, 2026 06:483,82040,214,40730,550,0001,158,0002,117,632stderr