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 17:37A_ShamanA_ShamanScore: 38,082Success
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 17:3838,073325,340,540315,012,0001,002,0002,113,536
2Jul 2, 2026 17:3838,076327,003,609315,035,0001,004,0002,113,536
3Jul 2, 2026 17:3838,078325,423,735315,049,0001,004,0002,113,536
4Jul 2, 2026 17:3838,080325,468,549315,069,0001,003,0002,113,536
5Jul 2, 2026 17:3838,082325,402,413315,079,0001,003,0002,113,536
6Jul 2, 2026 17:3838,088325,448,513315,134,0001,004,0002,113,536
7Jul 2, 2026 17:3838,091325,539,349315,154,0001,004,0002,113,536
8Jul 2, 2026 17:3838,095325,542,692315,188,0001,003,0002,113,536
9Jul 2, 2026 17:3838,114325,682,404315,345,0001,002,0002,113,536