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 27, 2026 13:29Daniel MastalerzDaniel MastalerzError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 13:30045,841,43535,327,0001,043,0002,113,536expected "53691296144128825 ", got "53691270544128825"
2Jun 27, 2026 13:30045,688,15035,192,0001,030,0002,113,536expected "53691279492477826 ", got "53691279489917826"
3Jun 27, 2026 13:304,32845,356,74034,889,0001,038,0002,113,536
4Jun 27, 2026 13:304,33145,374,41934,926,0001,026,0002,113,536
5Jun 27, 2026 13:304,34445,545,10635,004,0001,052,0002,113,536
6Jun 27, 2026 13:304,34445,507,57635,019,0001,042,0002,113,536
7Jun 27, 2026 13:304,35445,652,89435,105,0001,039,0002,113,536
8Jun 27, 2026 13:304,36645,794,99635,207,0001,039,0002,113,536
9Jun 27, 2026 13:304,36745,667,29135,231,0001,018,0002,113,536