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:40Innokentii MeleshchenkoInnokentii MeleshchenkoScore: 276,661Success
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:41276,1142,301,111,6822,228,698,00063,053,0002,117,632
2May 28, 2026 12:41276,2702,303,171,1732,228,978,00064,064,0002,117,632
3May 28, 2026 12:41276,4102,306,764,2482,230,145,00064,065,0002,117,632
4May 28, 2026 12:41276,4552,306,280,2372,229,527,00065,051,0002,117,632
5May 28, 2026 12:41276,6612,307,276,9402,232,234,00064,057,0002,117,632
6May 28, 2026 12:41277,0142,311,910,3352,235,167,00064,057,0002,117,632
7May 28, 2026 12:41277,0222,309,008,4892,235,121,00064,168,0002,117,632
8May 28, 2026 12:41277,7912,317,294,6182,241,613,00064,056,0002,117,632
9May 28, 2026 12:41278,7832,325,026,8262,249,840,00064,063,0002,117,632