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 21, 2026 20:26A_ShamanA_ShamanScore: 83,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 20:2683,610702,945,680692,965,0001,004,0002,113,536
2Jun 21, 2026 20:2683,626703,243,831693,098,0001,002,0002,113,536
3Jun 21, 2026 20:2683,663703,545,351693,401,0001,002,0002,113,536
4Jun 21, 2026 20:2683,718704,002,784693,864,0001,002,0002,113,536
5Jun 21, 2026 20:2683,735704,153,417693,999,0001,004,0002,113,536
6Jun 21, 2026 20:2683,741704,155,964694,047,0001,004,0002,113,536
7Jun 21, 2026 20:2683,869705,279,879695,118,0001,002,0002,113,536
8Jun 21, 2026 20:2684,746712,584,011702,394,0001,002,0002,113,536
9Jun 21, 2026 20:2684,752712,538,993702,442,0001,003,0002,113,536