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 15:59Kenzie_RTKenzie_RTScore: 51,653Success
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 15:5950,676430,250,179419,556,0001,056,0002,113,536
2May 25, 2026 15:5950,713432,505,651419,855,0001,066,0002,113,536
3May 25, 2026 15:5950,714430,122,391419,875,0001,056,0002,113,536
4May 25, 2026 15:5950,760430,638,482420,257,0001,059,0002,113,536
5May 25, 2026 15:5951,653438,462,137427,717,0001,007,0002,113,536
6May 25, 2026 15:5951,718439,219,178428,137,0001,130,0002,113,536
7May 25, 2026 15:5951,751440,708,485428,401,0001,138,0002,113,536
8May 25, 2026 15:5951,757439,795,056428,526,0001,065,0002,113,536
9May 25, 2026 15:5951,787450,446,333428,604,0001,233,0002,113,536