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 listApr 24, 2025 21:26Dmitry YudakovDmitry YudakovScore: 77,054Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2025 21:2677,032670,473,643637,364,0002,001,0002,523,136
2Apr 24, 2025 21:2677,032664,885,398637,361,0002,001,0002,293,760
3Apr 24, 2025 21:2677,035666,381,824637,389,0002,001,0002,547,712
4Apr 24, 2025 21:2677,054667,126,693637,548,0001,998,0002,506,752
5Apr 24, 2025 21:2677,061667,178,940637,612,0001,998,0002,519,040
6Apr 24, 2025 21:2677,088668,393,620638,828,000999,0002,514,944