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 listMay 20, 2026 18:25Victor MerckléVictor MerckléScore: 4,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 18:284,80348,473,62138,806,0001,065,0002,117,632stderr
2May 20, 2026 18:284,81048,568,61038,862,0001,065,0002,117,632stderr
3May 20, 2026 18:284,83049,728,70539,082,0001,009,0002,117,632stderr
4May 20, 2026 18:284,83348,348,13839,089,0001,033,0002,117,632stderr
5May 20, 2026 18:284,83450,000,85339,114,0001,009,0002,117,632stderr
6May 20, 2026 18:284,83549,735,11439,072,0001,063,0002,117,632stderr
7May 20, 2026 18:284,83749,809,05039,116,0001,035,0002,117,632stderr
8May 20, 2026 18:284,84648,342,60739,194,0001,031,0002,117,632stderr
9May 20, 2026 18:284,86648,884,65439,258,0001,131,0002,117,632stderr