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 listDec 22, 2025 19:00Mark R BestMark R BestScore: 59,054Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 19:0058,942516,538,647432,196,00057,025,0002,289,664
2Dec 22, 2025 19:0058,950512,402,704442,260,00047,027,0002,289,664
3Dec 22, 2025 19:0058,953513,295,946436,277,00053,033,0002,289,664
4Dec 22, 2025 19:0059,034522,137,745431,988,00057,998,0002,289,664
5Dec 22, 2025 19:0059,054516,847,831439,136,00051,015,0002,289,664
6Dec 22, 2025 19:0059,057520,298,109436,152,00054,018,0002,289,664
7Dec 22, 2025 19:0059,066521,336,485434,219,00056,028,0002,289,664
8Dec 22, 2025 19:0059,123513,706,185430,752,00059,965,0002,277,376
9Dec 22, 2025 19:0059,208521,202,343431,375,00060,052,0002,289,664