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 listJun 22, 2026 10:26Omkar SinghOmkar SinghScore: 1,648,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 10:311,636,92413,597,337,93113,517,336,00069,141,0002,113,536
2Jun 22, 2026 10:311,638,59313,629,125,41813,531,260,00069,065,0002,113,536
3Jun 22, 2026 10:311,639,67013,626,821,29013,526,212,00083,056,0002,113,536
4Jun 22, 2026 10:311,641,04813,630,481,80213,553,654,00067,045,0002,113,536
5Jun 22, 2026 10:311,648,56413,693,435,22213,614,976,00068,109,0002,113,536
6Jun 22, 2026 10:311,708,08414,187,820,16314,111,057,00066,041,0002,113,536
7Jun 22, 2026 10:311,714,69614,241,604,24714,130,916,000101,069,0002,113,536
8Jun 22, 2026 10:311,789,75114,864,438,88814,789,906,00065,034,0002,113,536
9Jun 22, 2026 10:311,829,95115,198,500,71515,122,493,00066,102,0002,113,536