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 listJul 3, 2026 17:21Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 17:210309,832,921299,395,0001,003,0002,113,536expected "53684992085458228 ", got "53684992872247463 "
2Jul 3, 2026 17:2136,203310,304,464299,490,0001,002,0002,113,536
3Jul 3, 2026 17:2136,247310,281,421299,853,0001,003,0002,113,536
4Jul 3, 2026 17:2136,251310,769,966299,886,0001,003,0002,113,536
5Jul 3, 2026 17:2136,279310,913,105300,118,0001,004,0002,113,536
6Jul 3, 2026 17:2136,280310,945,725300,124,0001,004,0002,113,536
7Jul 3, 2026 17:2136,322310,949,510300,470,0001,004,0002,113,536
8Jul 3, 2026 17:2136,336312,923,523300,582,0001,013,0002,113,536
9Jul 3, 2026 17:2136,405312,023,405301,164,0001,004,0002,113,536