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 6, 2026 17:39Kevin HeaveyKevin HeaveyScore: 7,070Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:406,89666,778,68656,071,0001,168,0002,117,632
2Jul 6, 2026 17:406,93367,054,01356,373,0001,178,0002,117,632
3Jul 6, 2026 17:407,00067,609,19156,957,0001,147,0002,117,632
4Jul 6, 2026 17:407,02367,837,72057,123,0001,170,0002,117,632
5Jul 6, 2026 17:407,07068,222,58957,510,0001,171,0002,117,632
6Jul 6, 2026 17:407,12068,646,59457,946,0001,153,0002,117,632
7Jul 6, 2026 17:407,21269,388,42958,689,0001,177,0002,117,632
8Jul 6, 2026 17:407,27069,858,22659,183,0001,165,0002,117,632
9Jul 6, 2026 17:407,52271,971,69461,264,0001,172,0002,117,632