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 listMay 19, 2026 08:31poilonpoilonScore: 14,095Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 08:3114,012127,559,921115,244,0001,059,0002,113,536
2May 19, 2026 08:3114,031125,674,962115,271,0001,188,0002,113,536
3May 19, 2026 08:3114,081128,983,372115,716,0001,160,0002,113,536
4May 19, 2026 08:3114,093128,976,374115,807,0001,168,0002,113,536
5May 19, 2026 08:3114,095127,130,447115,828,0001,168,0002,113,536
6May 19, 2026 08:3114,097127,943,812115,984,0001,024,0002,113,536
7May 19, 2026 08:3114,098127,963,239115,837,0001,181,0002,113,536
8May 19, 2026 08:3114,103130,539,778115,881,0001,178,0002,113,536
9May 19, 2026 08:3114,118127,133,244116,005,0001,181,0002,113,536