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 listFeb 24, 2026 19:16Daniel MastalerzDaniel MastalerzScore: 5,833Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 19:165,72470,719,19744,475,0003,032,0002,326,528
2Feb 24, 2026 19:165,72574,921,31744,484,0003,033,0002,269,184
3Feb 24, 2026 19:165,76177,016,60145,823,0001,992,0002,277,376
4Feb 24, 2026 19:165,83374,173,50744,378,0004,034,0002,306,048
5Feb 24, 2026 19:165,89271,493,12944,910,0003,992,0002,269,184
6Feb 24, 2026 19:166,04676,340,67146,165,0004,014,0002,314,240