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 listMay 16, 2026 04:47Victor MerckléVictor MerckléScore: 6,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 04:476,95167,597,90156,657,0001,037,0002,113,536
2May 16, 2026 04:476,95665,946,82356,703,0001,035,0002,113,536
3May 16, 2026 04:476,95767,190,11156,744,0001,003,0002,113,536
4May 16, 2026 04:476,96167,346,42356,772,0001,012,0002,113,536
5May 16, 2026 04:476,96265,399,45956,763,0001,025,0002,113,536
6May 16, 2026 04:476,98167,330,43656,884,0001,064,0002,113,536
7May 16, 2026 04:477,01765,657,72157,201,0001,041,0002,113,536
8May 16, 2026 04:477,02067,074,17057,239,0001,035,0002,113,536
9May 16, 2026 04:477,12668,378,18658,146,0001,007,0002,113,536