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 listMar 3, 2026 07:13Uzman ZawahirUzman ZawahirScore: 2,066,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 07:132,057,88417,111,103,38317,013,468,00066,966,0002,281,472
2Mar 3, 2026 07:132,063,45017,161,586,08517,067,654,00058,978,0002,281,472
3Mar 3, 2026 07:132,064,33417,168,560,15617,066,007,00067,968,0002,281,472
4Mar 3, 2026 07:132,064,81417,169,398,86417,073,988,00063,969,0002,281,472
5Mar 3, 2026 07:132,066,25717,185,424,42117,074,961,00074,969,0002,289,664
6Mar 3, 2026 07:132,067,09417,188,888,10417,092,908,00063,969,0002,281,472
7Mar 3, 2026 07:132,068,87717,204,644,34017,107,706,00063,972,0002,265,088
8Mar 3, 2026 07:132,071,73417,227,903,13417,124,426,00070,968,0002,281,472
9Mar 3, 2026 07:132,077,55317,273,704,99617,172,729,00070,965,0002,281,472