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 10:20Daniel 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 10:210149,629,135139,119,0001,032,0002,113,536expected "53685062654810222 ", got "53685062629210222"
2Jun 27, 2026 10:2116,910149,783,432139,236,0001,119,0002,113,536
3Jun 27, 2026 10:2116,931150,426,651139,481,0001,050,0002,113,536
4Jun 27, 2026 10:2117,038150,975,728140,389,0001,033,0002,113,536
5Jun 27, 2026 10:2117,044150,971,681140,447,0001,023,0002,113,536
6Jun 27, 2026 10:2117,139151,774,823141,209,0001,049,0002,113,536
7Jun 27, 2026 10:2117,242152,554,008141,921,0001,190,0002,113,536
8Jun 27, 2026 10:2117,459154,374,612143,891,0001,022,0002,113,536
9Jun 27, 2026 10:2118,146160,058,973149,611,0001,008,0002,113,536