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 13, 2026 20:00Krishn ParasarKrishn ParasarScore: 2,067,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 20:002,064,36517,170,041,45517,070,261,00063,970,0002,281,472
2Feb 13, 2026 20:002,065,86417,184,095,41017,073,707,00072,964,0002,281,472
3Feb 13, 2026 20:002,065,97017,183,184,94417,085,581,00061,973,0002,281,472
4Feb 13, 2026 20:002,066,78917,186,413,77817,085,373,00068,973,0002,281,472
5Feb 13, 2026 20:002,067,09717,187,628,89117,088,935,00067,967,0002,281,472
6Feb 13, 2026 20:002,067,49217,195,526,27917,084,219,00075,965,0002,293,760
7Feb 13, 2026 20:002,067,66817,190,349,46417,080,683,00080,965,0002,510,848
8Feb 13, 2026 20:002,068,28617,207,260,60917,106,809,00059,967,0002,281,472
9Feb 13, 2026 20:002,070,48317,214,385,34717,119,036,00065,969,0002,281,472