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 25, 2026 11:49Victor MerckléVictor MerckléScore: 3,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 11:503,73139,418,69229,806,0001,165,0002,117,632stderr
2Aug 25, 2026 11:503,74139,431,45429,876,0001,177,0002,117,632stderr
3Aug 25, 2026 11:503,77240,340,60030,186,0001,126,0002,117,632stderr
4Aug 25, 2026 11:503,77439,724,46630,248,0001,084,0002,117,632stderr
5Aug 25, 2026 11:503,77740,929,86330,270,0001,086,0002,117,632stderr
6Aug 25, 2026 11:503,78339,789,08630,237,0001,167,0002,117,632stderr
7Aug 25, 2026 11:503,79039,826,73530,375,0001,089,0002,117,632stderr
8Aug 25, 2026 11:503,79639,903,46130,318,0001,196,0002,117,632stderr
9Aug 25, 2026 11:503,80139,960,25530,483,0001,070,0002,117,632stderr