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 14:40Josu San MartinJosu San MartinScore: 28,731Success
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 14:4028,605258,320,196236,419,0001,001,0002,273,280
2Dec 29, 2025 14:4028,623266,988,420236,572,0001,002,0002,400,256
3Dec 29, 2025 14:4028,655261,691,197236,840,000999,0002,273,280
4Dec 29, 2025 14:4028,703264,783,502237,235,0001,000,0002,273,280
5Dec 29, 2025 14:4028,731264,503,838237,463,0001,001,0002,273,280
6Dec 29, 2025 14:4028,734267,092,213237,489,0001,002,0002,281,472
7Dec 29, 2025 14:4028,741261,858,584238,550,00002,273,280
8Dec 29, 2025 14:4028,747263,465,937237,600,0001,002,0002,392,064
9Dec 29, 2025 14:4028,776266,153,668237,842,000999,0002,404,352