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 listJun 4, 2025 06:28thatmagicalcatthatmagicalcatScore: 59,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2025 06:2859,308522,553,214472,245,00020,010,000303,104
2Jun 4, 2025 06:2859,361524,922,644471,709,00020,987,000303,104
3Jun 4, 2025 06:2859,440515,473,443471,334,00022,015,000225,280
4Jun 4, 2025 06:2859,644520,612,268473,043,00022,002,000258,048
5Jun 4, 2025 06:2859,651516,997,176473,102,00022,004,000221,184
6Jun 4, 2025 06:2861,270538,136,754474,574,00033,969,0002,347,008
7Jun 4, 2025 06:2861,654538,859,687473,752,00037,980,000405,504
8Jun 4, 2025 06:2876,9072,296,532,480455,124,000183,206,000153,477,120
9Jun 4, 2025 06:2877,8752,004,516,882463,654,000182,711,0002,424,832