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 listFeb 10, 2026 20:06Aleksandr MedvedevAleksandr MedvedevScore: 2,068,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 20:062,067,32417,189,153,98517,077,821,00080,965,0002,281,472
2Feb 10, 2026 20:062,068,14317,201,165,50217,107,613,00057,974,0002,281,472
3Feb 10, 2026 20:062,068,35317,202,273,85017,085,370,00081,963,0002,293,760
4Feb 10, 2026 20:062,068,48717,206,550,57917,099,479,00068,965,0002,281,472
5Feb 10, 2026 20:062,068,64717,199,811,64417,107,799,00061,970,0002,281,472
6Feb 10, 2026 20:062,068,79917,211,092,95017,100,064,00070,971,0002,281,472
7Feb 10, 2026 20:062,069,05517,213,905,95417,110,191,00062,967,0002,289,664
8Feb 10, 2026 20:062,071,56517,223,515,56317,135,012,00058,975,0002,281,472
9Feb 10, 2026 20:062,071,95017,225,024,54317,132,214,00064,974,0002,281,472