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 11, 2026 07:37wnwnScore: 3,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:383,28436,552,31727,262,00002,113,536
2May 11, 2026 07:383,29634,661,30726,348,0001,016,0002,113,536
3May 11, 2026 07:383,31334,736,28826,487,0001,012,0002,113,536
4May 11, 2026 07:383,39435,495,27028,171,00002,113,536
5May 11, 2026 07:383,41637,582,93428,359,00002,113,536
6May 11, 2026 07:383,44137,865,35628,564,00002,113,536
7May 11, 2026 07:383,44937,192,27228,628,00002,113,536
8May 11, 2026 07:383,45236,062,58128,652,00002,113,536
9May 11, 2026 07:383,48338,202,95528,914,00002,113,536