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:58A_ShamanA_ShamanScore: 61,771Success
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:5861,664520,854,597450,738,00061,076,0002,113,536
2Jun 20, 2026 18:5861,666520,943,500450,475,00061,359,0002,113,536
3Jun 20, 2026 18:5861,735521,814,407450,866,00061,538,0002,113,536
4Jun 20, 2026 18:5861,740521,757,973450,781,00061,664,0002,113,536
5Jun 20, 2026 18:5861,771521,700,926450,711,00061,995,0002,113,536
6Jun 20, 2026 18:5861,927523,097,636451,002,00062,997,0002,113,536
7Jun 20, 2026 18:5861,959523,234,605451,243,00063,019,0002,113,536
8Jun 20, 2026 18:5862,042524,054,542450,929,00064,021,0002,113,536
9Jun 20, 2026 18:5862,058524,337,749451,224,00063,858,0002,113,536