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 listNov 23, 2025 18:11j3o1j3o1Score: 42,539Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2025 18:1142,526378,438,930350,966,0001,999,0002,285,568
2Nov 23, 2025 18:1142,536380,165,506351,051,0002,000,0002,523,136
3Nov 23, 2025 18:1142,537381,326,344352,061,0001,000,0002,285,568
4Nov 23, 2025 18:1142,537382,706,643351,061,0002,000,0002,531,328
5Nov 23, 2025 18:1142,539385,297,363351,070,0002,000,0002,519,040
6Nov 23, 2025 18:1142,539383,224,893353,077,00002,285,568
7Nov 23, 2025 18:1142,541383,633,233352,087,0001,000,0002,285,568
8Nov 23, 2025 18:1142,552380,585,388351,178,0002,001,0002,281,472
9Nov 23, 2025 18:1142,554380,005,987352,196,0001,000,0002,285,568