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 17, 2026 23:38A_ShamanA_ShamanScore: 67,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 23:3866,992565,136,836494,631,00061,409,0002,113,536
2Jun 17, 2026 23:3866,996565,181,572494,328,00061,739,0002,113,536
3Jun 17, 2026 23:3867,001565,171,150494,191,00061,919,0002,113,536
4Jun 17, 2026 23:3867,038565,582,958493,699,00062,721,0002,113,536
5Jun 17, 2026 23:3867,045565,542,128494,162,00062,318,0002,113,536
6Jun 17, 2026 23:3867,055565,660,757494,392,00062,168,0002,113,536
7Jun 17, 2026 23:3867,121566,128,426494,809,00062,299,0002,113,536
8Jun 17, 2026 23:3867,141566,458,550494,285,00062,993,0002,113,536
9Jun 17, 2026 23:3867,181566,696,468495,094,00062,511,0002,113,536