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 28, 2026 19:06Victor MerckléVictor MerckléScore: 5,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 19:065,21252,306,60042,244,0001,020,0002,117,632stderr
2Aug 28, 2026 19:065,21452,298,17542,262,0001,019,0002,117,632stderr
3Aug 28, 2026 19:065,23752,465,38842,453,0001,020,0002,117,632stderr
4Aug 28, 2026 19:065,23952,513,81342,469,0001,022,0002,117,632stderr
5Aug 28, 2026 19:065,25351,733,58242,579,0001,021,0002,117,632stderr
6Aug 28, 2026 19:065,25952,699,64742,615,0001,039,0002,117,632stderr
7Aug 28, 2026 19:065,26452,753,40042,672,0001,022,0002,117,632stderr
8Aug 28, 2026 19:065,28352,873,60342,834,0001,019,0002,117,632stderr
9Aug 28, 2026 19:065,32653,192,86343,181,0001,030,0002,117,632stderr