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 listDec 29, 2025 05:28Josu San MartinJosu San MartinScore: 30,601Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 05:2830,596275,310,360251,946,0001,999,0002,400,256
2Dec 29, 2025 05:2830,598277,357,969251,964,0001,999,0002,396,160
3Dec 29, 2025 05:2830,600277,981,469252,980,000999,0002,404,352
4Dec 29, 2025 05:2830,601273,168,527252,988,000999,0002,269,184
5Dec 29, 2025 05:2830,601279,317,989252,992,000999,0002,400,256
6Dec 29, 2025 05:2830,603277,265,059252,005,0002,000,0002,400,256
7Dec 29, 2025 05:2830,608281,153,131252,048,0002,000,0002,269,184
8Dec 29, 2025 05:2830,611275,712,635252,075,0002,000,0002,269,184
9Dec 29, 2025 05:2830,614277,493,564253,100,0001,000,0002,269,184