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 listApr 4, 2026 11:07Adewuyi IsraelAdewuyi IsraelScore: 2,068,833Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2026 11:072,063,26117,157,684,83417,062,103,00062,967,0002,281,472
2Apr 4, 2026 11:072,067,00517,188,439,05717,084,167,00071,971,0002,281,472
3Apr 4, 2026 11:072,067,47817,192,707,60717,091,098,00068,972,0002,281,472
4Apr 4, 2026 11:072,067,89217,197,541,95417,106,528,00056,975,0002,281,472
5Apr 4, 2026 11:072,068,83317,204,718,44917,100,344,00070,972,0002,281,472
6Apr 4, 2026 11:072,069,67017,210,456,40417,104,298,00073,962,0002,281,472
7Apr 4, 2026 11:072,070,35717,216,856,53517,117,997,00065,969,0002,293,760
8Apr 4, 2026 11:072,070,64417,217,290,16617,115,381,00070,964,0002,281,472
9Apr 4, 2026 11:072,071,98217,231,811,05617,132,481,00064,971,0002,281,472