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 listJul 15, 2026 08:42boop34boop34Score: 12,979Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 08:4312,818116,093,956105,355,0001,040,0002,113,536
2Jul 15, 2026 08:4312,819116,131,960105,360,0001,039,0002,113,536
3Jul 15, 2026 08:4312,838116,296,368105,498,0001,059,0002,113,536
4Jul 15, 2026 08:4312,895116,732,517106,001,0001,029,0002,113,536
5Jul 15, 2026 08:4312,979118,088,042106,683,0001,049,0002,113,536
6Jul 15, 2026 08:4312,994117,562,562106,770,0001,085,0002,113,536
7Jul 15, 2026 08:4313,014118,401,652106,969,0001,050,0002,113,536
8Jul 15, 2026 08:4313,145118,804,877108,067,0001,040,0002,113,536
9Jul 15, 2026 08:4313,288120,041,630109,262,0001,031,0002,113,536