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 14, 2026 21:02boop34boop34Score: 15,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 21:0315,239136,174,040125,439,0001,047,0002,113,536
2Jul 14, 2026 21:0315,259136,358,832125,610,0001,040,0002,113,536
3Jul 14, 2026 21:0315,268136,523,312125,673,0001,059,0002,113,536
4Jul 14, 2026 21:0315,271136,500,443125,702,0001,053,0002,113,536
5Jul 14, 2026 21:0315,291136,607,069125,892,0001,024,0002,113,536
6Jul 14, 2026 21:0315,327136,812,561126,148,0001,072,0002,113,536
7Jul 14, 2026 21:0315,623139,892,541128,610,0001,064,0002,113,536
8Jul 14, 2026 21:0315,767140,567,477129,836,0001,038,0002,113,536
9Jul 14, 2026 21:0315,823141,655,967130,294,0001,038,0002,113,536