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 12:04Aliaksandr MikheiAliaksandr MikheiScore: 75,556Success
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 12:0575,370648,455,637571,606,00053,962,0002,269,184
2Nov 12, 2025 12:0575,457656,636,992579,271,00047,022,0002,285,568
3Nov 12, 2025 12:0575,485651,934,750578,560,00047,963,0002,277,376
4Nov 12, 2025 12:0575,487656,283,123537,606,00088,934,0002,285,568
5Nov 12, 2025 12:0575,496650,665,772559,658,00066,959,0002,265,088
6Nov 12, 2025 12:0575,541650,990,632576,991,00049,999,0002,285,568
7Nov 12, 2025 12:0575,556649,949,457571,105,00056,010,0002,285,568
8Nov 12, 2025 12:0575,557646,925,897544,106,00083,016,0002,289,664
9Nov 12, 2025 12:0575,630651,018,427567,754,00059,974,0002,519,040
10Nov 12, 2025 12:0476,499659,068,974576,944,00057,994,0002,285,568
11Nov 12, 2025 12:0476,594660,293,424577,752,00057,975,0002,285,568
12Nov 12, 2025 12:0476,650663,257,338576,173,00060,018,0002,277,376