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 listMay 28, 2026 12:30Innokentii MeleshchenkoInnokentii MeleshchenkoScore: 391,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 28, 2026 12:31391,1773,257,502,0953,183,729,00063,045,0002,117,632
2May 28, 2026 12:31391,4903,260,934,4603,185,162,00064,206,0002,117,632
3May 28, 2026 12:31391,5693,260,710,3753,185,966,00064,057,0002,117,632
4May 28, 2026 12:31391,5923,261,706,4283,185,963,00064,255,0002,117,632
5May 28, 2026 12:31391,9913,263,023,4133,189,407,00064,121,0002,117,632
6May 28, 2026 12:31392,1733,267,149,7313,190,976,00064,062,0002,117,632
7May 28, 2026 12:31392,6503,268,517,9983,193,951,00065,049,0002,117,632
8May 28, 2026 12:31402,8103,352,861,5193,280,274,00063,056,0002,117,632
9May 28, 2026 12:31405,5283,376,234,0573,301,828,00064,062,0002,117,632