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 listJan 2, 2026 06:04Josu San MartinJosu San MartinScore: 6,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 06:046,12176,594,97749,806,000996,0002,506,752
2Jan 2, 2026 06:046,12475,545,57448,838,0001,993,0002,416,640
3Jan 2, 2026 06:046,16278,714,06948,133,0003,008,0002,375,680
4Jan 2, 2026 06:046,38475,661,99350,992,0001,999,0002,506,752
5Jan 2, 2026 06:046,40876,997,90851,179,0002,007,0002,301,952
6Jan 2, 2026 06:046,45081,551,48648,582,0004,957,0002,420,736