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:49Kenzie_RTKenzie_RTScore: 51,188Success
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:4950,678431,527,624419,582,0001,053,0002,113,536
2May 25, 2026 16:4950,680429,898,337419,586,0001,063,0002,113,536
3May 25, 2026 16:4950,702430,976,252419,776,0001,057,0002,113,536
4May 25, 2026 16:4951,147433,901,443423,391,0001,134,0002,113,536
5May 25, 2026 16:4951,188435,102,081423,741,0001,120,0002,113,536
6May 25, 2026 16:4951,379436,310,444425,361,0001,087,0002,113,536
7May 25, 2026 16:4951,399436,364,592425,613,0001,006,0002,113,536
8May 25, 2026 16:4951,689440,317,609427,960,0001,064,0002,113,536
9May 25, 2026 16:4951,698439,424,185428,036,0001,063,0002,113,536