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 20, 2026 06:45M-RochatM-RochatScore: 14,073Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 06:4514,012130,575,425114,292,0002,010,0002,113,536
2May 20, 2026 06:4514,048127,127,752114,557,0002,049,0002,113,536
3May 20, 2026 06:4514,054128,787,977114,582,0002,068,0002,113,536
4May 20, 2026 06:4514,058127,711,783114,351,0002,331,0002,113,536
5May 20, 2026 06:4514,073128,649,079114,749,0002,063,0002,113,536
6May 20, 2026 06:4514,088127,359,223114,880,0002,055,0002,113,536
7May 20, 2026 06:4514,108129,104,497115,028,0002,075,0002,113,536
8May 20, 2026 06:4514,116127,183,433115,110,0002,055,0002,113,536
9May 20, 2026 06:4514,120129,077,169115,143,0002,053,0002,113,536