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 2, 2026 18:05A_ShamanA_ShamanScore: 36,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 18:0536,382311,627,038300,975,0001,003,0002,113,536
2Jul 2, 2026 18:0536,382311,579,030300,966,0001,005,0002,113,536
3Jul 2, 2026 18:0536,388312,022,537301,023,0001,004,0002,113,536
4Jul 2, 2026 18:0536,395312,030,913300,048,0002,037,0002,113,536
5Jul 2, 2026 18:0536,397312,041,738300,085,0002,011,0002,113,536
6Jul 2, 2026 18:0536,400311,667,431301,117,0001,005,0002,113,536
7Jul 2, 2026 18:0536,402312,073,631300,120,0002,021,0002,113,536
8Jul 2, 2026 18:0536,406311,800,365301,171,0001,006,0002,113,536
9Jul 2, 2026 18:0536,434312,446,514300,402,0002,004,0002,113,536