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 21, 2026 20:46A_ShamanA_ShamanScore: 63,258Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 20:4663,121533,105,498451,065,00072,844,0002,113,536
2Jun 21, 2026 20:4663,155533,300,595450,946,00073,241,0002,113,536
3Jun 21, 2026 20:4663,194533,770,935450,943,00073,568,0002,113,536
4Jun 21, 2026 20:4663,205534,529,812450,912,00073,691,0002,113,536
5Jun 21, 2026 20:4663,258534,309,276451,162,00073,884,0002,113,536
6Jun 21, 2026 20:4663,486536,034,134451,782,00075,159,0002,113,536
7Jun 21, 2026 20:4664,643545,586,211455,033,00081,512,0002,113,536
8Jun 21, 2026 20:4664,720546,235,827454,915,00082,263,0002,113,536
9Jun 21, 2026 20:4664,863547,456,961454,869,00083,498,0002,113,536