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 5, 2025 10:56caandocaandoScore: 5,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 10:565,52672,858,95943,873,0001,994,0002,285,568
2Nov 5, 2025 10:565,55269,641,81644,078,0002,003,0002,527,232
3Nov 5, 2025 10:565,60375,500,40245,495,0001,011,0002,265,088
4Nov 5, 2025 10:565,60666,577,52645,515,0001,011,0002,277,376
5Nov 5, 2025 10:565,60770,439,50246,536,00002,510,848
6Nov 5, 2025 10:565,61470,405,52245,585,0001,013,0002,265,088
7Nov 5, 2025 10:565,61669,241,67845,601,0001,013,0002,363,392
8Nov 5, 2025 10:565,61970,620,40345,621,0001,013,0002,519,040
9Nov 5, 2025 10:565,63873,016,79244,803,0001,991,0002,285,568
10Nov 5, 2025 10:565,72270,878,16747,490,00002,285,568
11Nov 5, 2025 10:565,72569,788,29547,518,00002,285,568
12Nov 5, 2025 10:565,74372,520,40147,666,00002,285,568