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 19, 2026 17:45A_ShamanA_ShamanScore: 45,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 17:4545,133383,758,350291,974,00082,637,0002,113,536
2Jun 19, 2026 17:4545,380386,945,377292,214,00084,448,0002,113,536
3Jun 19, 2026 17:4545,409385,948,674292,032,00084,866,0002,113,536
4Jun 19, 2026 17:4545,774388,952,698293,848,00086,082,0002,113,536
5Jun 19, 2026 17:4545,943390,360,590294,061,00087,270,0002,113,536
6Jun 19, 2026 17:4546,003390,849,415294,057,00087,772,0002,113,536
7Jun 19, 2026 17:4546,011391,013,986293,784,00088,114,0002,113,536
8Jun 19, 2026 17:4546,028391,097,248293,980,00088,056,0002,113,536
9Jun 19, 2026 17:4546,133392,038,389294,011,00088,896,0002,113,536