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 29, 2025 08:51Aman | अमनAman | अमनScore: 523,949Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 08:51523,6624,377,882,9054,279,437,00066,959,0002,281,472
2Dec 29, 2025 08:51523,6954,374,538,0074,270,711,00075,959,0002,281,472
3Dec 29, 2025 08:51523,7634,379,973,0724,268,262,00078,967,0002,281,472
4Dec 29, 2025 08:51523,8184,374,471,4604,285,721,00061,967,0002,281,472
5Dec 29, 2025 08:51523,9494,374,808,7524,267,822,00080,958,0002,281,472
6Dec 29, 2025 08:51524,0524,382,223,9054,283,664,00065,964,0002,289,664
7Dec 29, 2025 08:51524,0724,375,156,2294,280,835,00068,965,0002,281,472
8Dec 29, 2025 08:51524,1024,374,681,5864,290,076,00059,973,0002,498,560
9Dec 29, 2025 08:51524,1954,376,690,2334,282,853,00067,965,0002,281,472