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 20, 2026 18:56A_ShamanA_ShamanScore: 69,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 18:5669,178583,340,164513,711,00060,467,0002,113,536
2Jun 20, 2026 18:5669,258583,985,676513,364,00061,485,0002,113,536
3Jun 20, 2026 18:5669,327585,988,851514,034,00061,388,0002,113,536
4Jun 20, 2026 18:5669,410585,632,487514,130,00061,977,0002,113,536
5Jun 20, 2026 18:5669,466585,600,606513,318,00063,251,0002,113,536
6Jun 20, 2026 18:5669,471585,992,686513,938,00062,678,0002,113,536
7Jun 20, 2026 18:5669,497586,121,875514,776,00062,053,0002,113,536
8Jun 20, 2026 18:5669,521586,170,822513,838,00063,189,0002,113,536
9Jun 20, 2026 18:5669,715587,690,222514,584,00064,058,0002,113,536