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 19, 2025 15:29Josu San MartinJosu San MartinScore: 50,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 15:2950,473444,814,537416,926,0001,999,0002,285,568
2Dec 19, 2025 15:2950,476444,213,173417,954,000999,0002,281,472
3Dec 19, 2025 15:2950,480447,423,604416,988,0001,999,0002,359,296
4Dec 19, 2025 15:2950,496442,395,904419,116,00002,285,568
5Dec 19, 2025 15:2950,504440,688,824418,182,0001,000,0002,285,568
6Dec 19, 2025 15:2950,504445,354,100419,184,00002,342,912
7Dec 19, 2025 15:2950,505452,607,654418,192,0001,000,0002,355,200
8Dec 19, 2025 15:2950,512445,269,828419,253,00002,281,472
9Dec 19, 2025 15:2950,526449,331,289418,369,0001,000,0002,285,568