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 listSep 26, 2026 16:29Kevin HeaveyKevin HeaveyScore: 3,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 16:323,18935,204,43426,471,000020,480
2Sep 26, 2026 16:323,19235,300,74226,500,000020,480
3Sep 26, 2026 16:323,19635,278,13126,535,000020,480
4Sep 26, 2026 16:323,20035,308,12626,560,000020,480
5Sep 26, 2026 16:323,20735,274,78826,626,000020,480
6Sep 26, 2026 16:323,20835,374,78626,633,000020,480
7Sep 26, 2026 16:323,21135,516,91526,654,000020,480
8Sep 26, 2026 16:323,22135,477,18726,737,000020,480
9Sep 26, 2026 16:323,24935,879,46426,974,000020,480