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 12, 2025 11:59Aliaksandr MikheiAliaksandr MikheiScore: 76,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 11:5976,470657,989,408573,730,00060,971,0002,265,088
2Nov 12, 2025 11:5976,570665,791,854575,573,00059,955,0002,285,568
3Nov 12, 2025 11:5976,572660,314,148572,594,00062,955,0002,269,184
4Nov 12, 2025 11:5976,577659,972,762573,626,00061,959,0002,285,568
5Nov 12, 2025 11:5976,600657,727,947574,804,00060,979,0002,265,088
6Nov 12, 2025 11:5976,687666,523,330573,553,00062,950,0002,285,568
7Nov 12, 2025 11:5976,688661,728,685580,555,00055,957,0002,289,664
8Nov 12, 2025 11:5976,689666,636,911581,557,00054,958,0002,285,568
9Nov 12, 2025 11:5976,705662,528,529575,683,00060,966,0002,269,184