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:54Aliaksandr MikheiAliaksandr MikheiScore: 85,847Success
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:5485,634733,750,862658,781,00051,982,0002,273,280
2Nov 12, 2025 11:5485,787738,487,588655,030,00057,002,0002,269,184
3Nov 12, 2025 11:5485,792737,483,582654,066,00058,005,0002,269,184
4Nov 12, 2025 11:5485,800735,520,846653,131,00059,011,0002,289,664
5Nov 12, 2025 11:5485,847736,801,119653,573,00058,961,0002,277,376
6Nov 12, 2025 11:5485,848738,438,718649,580,00062,959,0002,285,568
7Nov 12, 2025 11:5485,891738,035,875652,906,00059,991,0002,277,376
8Nov 12, 2025 11:5485,920740,000,719653,125,00060,011,0002,285,568
9Nov 12, 2025 11:5485,947741,148,193652,415,00060,945,0002,285,568