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 25, 2026 16:25Kenzie_RTKenzie_RTScore: 51,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 16:2650,677431,701,332419,454,0001,166,0002,117,632
2May 25, 2026 16:2650,704430,891,586419,781,0001,065,0002,113,536
3May 25, 2026 16:2651,671438,053,701427,829,0001,042,0002,113,536
4May 25, 2026 16:2651,704438,277,867427,975,0001,176,0002,113,536
5May 25, 2026 16:2651,713438,711,816428,084,0001,136,0002,113,536
6May 25, 2026 16:2651,715441,454,053428,166,0001,070,0002,113,536
7May 25, 2026 16:2651,719440,444,543428,269,0001,001,0002,113,536
8May 25, 2026 16:2651,731439,015,475428,309,0001,060,0002,113,536
9May 25, 2026 16:2651,740438,784,796428,382,0001,065,0002,113,536