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:44A_ShamanA_ShamanScore: 47,252Success
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:4446,883398,308,701316,796,00072,334,0002,113,536
2Jun 21, 2026 20:4447,021401,217,123317,041,00073,237,0002,113,536
3Jun 21, 2026 20:4447,079399,875,199316,786,00073,972,0002,113,536
4Jun 21, 2026 20:4447,152400,523,440316,850,00074,517,0002,113,536
5Jun 21, 2026 20:4447,252401,323,389317,333,00074,864,0002,113,536
6Jun 21, 2026 20:4447,360402,240,721317,742,00075,350,0002,113,536
7Jun 21, 2026 20:4448,432411,089,801320,748,00081,244,0002,113,536
8Jun 21, 2026 20:4448,435411,120,753320,871,00081,146,0002,113,536
9Jun 21, 2026 20:4448,643412,900,097320,827,00082,918,0002,113,536