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 12, 2026 02:40Kevin HeaveyKevin HeaveyScore: 8,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 02:418,82682,929,35072,048,0001,216,0002,117,632
2Jul 12, 2026 02:418,89983,882,57772,703,0001,166,0002,117,632
3Jul 12, 2026 02:418,90083,475,13672,656,0001,219,0002,117,632
4Jul 12, 2026 02:418,91983,829,68372,791,0001,241,0002,117,632
5Jul 12, 2026 02:418,92183,707,98672,823,0001,223,0002,117,632
6Jul 12, 2026 02:418,93183,630,48472,885,0001,245,0002,117,632
7Jul 12, 2026 02:419,07786,326,76574,135,0001,209,0002,117,632
8Jul 12, 2026 02:419,08085,172,70874,123,0001,241,0002,117,632
9Jul 12, 2026 02:419,09685,025,11674,293,0001,207,0002,117,632