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 4, 2025 04:19Tejas G.Tejas G.Score: 7,837Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 04:197,81393,307,36362,857,0001,995,0002,285,568
2Nov 4, 2025 04:197,81991,162,04262,898,0001,996,0002,269,184
3Nov 4, 2025 04:197,82186,762,57563,914,000998,0002,285,568
4Nov 4, 2025 04:197,82489,006,33162,940,0001,998,0002,265,088
5Nov 4, 2025 04:197,82789,947,96262,965,0001,998,0002,285,568
6Nov 4, 2025 04:197,83090,068,80062,994,0001,999,0002,285,568
7Nov 4, 2025 04:197,83786,982,68463,042,0002,001,0002,285,568
8Nov 4, 2025 04:197,84191,766,78264,078,0001,001,0002,285,568
9Nov 4, 2025 04:197,86187,700,58163,236,0002,007,0002,260,992
10Nov 4, 2025 04:197,97389,381,67864,170,0002,005,0002,285,568
11Nov 4, 2025 04:198,04693,056,51766,781,00002,285,568
12Nov 4, 2025 04:198,04793,906,82165,790,000996,0002,265,088