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:09Josu San MartinJosu San MartinScore: 58,102Success
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:0958,093510,360,506481,176,0001,000,0002,285,568
2Dec 19, 2025 15:0958,098506,879,055481,211,0001,000,0002,285,568
3Dec 19, 2025 15:0958,099503,080,663482,218,00002,285,568
4Dec 19, 2025 15:0958,101504,423,235481,235,0001,000,0002,355,200
5Dec 19, 2025 15:0958,102507,286,858481,243,0001,000,0002,281,472
6Dec 19, 2025 15:0958,104503,983,940482,267,00002,363,392
7Dec 19, 2025 15:0958,109503,166,202482,302,00002,355,200
8Dec 19, 2025 15:0958,116509,935,194482,366,00002,285,568
9Dec 19, 2025 15:0958,121512,074,774482,406,00002,289,664