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 listSep 25, 2025 17:47Daniel MastalerzDaniel MastalerzScore: 45,880Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2025 17:4745,837406,890,865379,449,0001,001,0002,400,256
2Sep 25, 2025 17:4745,845407,362,041379,517,000998,0002,269,184
3Sep 25, 2025 17:4745,847410,010,165379,532,000998,0002,269,184
4Sep 25, 2025 17:4745,867403,556,840376,701,0003,996,0002,392,064
5Sep 25, 2025 17:4745,880409,145,751380,808,00002,269,184
6Sep 25, 2025 17:4745,886404,032,729379,855,000999,0002,392,064
7Sep 25, 2025 17:4745,890404,624,222375,893,0004,998,0002,392,064
8Sep 25, 2025 17:4745,913405,474,472380,078,0001,000,0002,269,184
9Sep 25, 2025 17:4745,983404,515,839379,664,0001,998,0002,396,160