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 27, 2025 18:20Josu San MartinJosu San MartinScore: 32,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 18:2032,251294,925,668265,683,0001,997,0002,289,664
2Dec 27, 2025 18:2032,255293,615,304265,722,0001,997,0002,289,664
3Dec 27, 2025 18:2032,260292,201,777267,759,00002,289,664
4Dec 27, 2025 18:2032,261299,237,268265,772,0001,998,0002,367,488
5Dec 27, 2025 18:2032,264301,118,253265,797,0001,998,0002,351,104
6Dec 27, 2025 18:2032,265295,857,194266,803,000999,0002,478,080
7Dec 27, 2025 18:2032,276297,495,879265,893,0001,999,0002,289,664
8Dec 27, 2025 18:2032,282292,983,288266,945,000999,0002,359,296
9Dec 27, 2025 18:2032,283293,186,958265,949,0001,999,0002,363,392