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:53Aliaksandr MikheiAliaksandr MikheiScore: 85,859Success
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:5385,622732,992,699651,690,00058,972,0002,367,488
2Nov 12, 2025 11:5385,689737,632,177650,199,00061,018,0002,277,376
3Nov 12, 2025 11:5385,756734,615,180649,796,00061,980,0002,265,088
4Nov 12, 2025 11:5385,786739,884,886649,019,00063,001,0002,285,568
5Nov 12, 2025 11:5385,859734,828,582652,659,00059,968,0002,387,968
6Nov 12, 2025 11:5385,913740,818,519653,071,00060,006,0002,289,664
7Nov 12, 2025 11:5385,945735,877,967653,399,00059,944,0002,379,776
8Nov 12, 2025 11:5385,964738,822,069652,545,00060,957,0002,277,376
9Nov 12, 2025 11:5385,980740,751,330647,666,00065,965,0002,269,184