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 27, 2025 14:52tonysui88tonysui88Score: 2,066,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 14:522,058,25317,112,618,94817,028,524,00054,975,0002,277,376
2Dec 27, 2025 14:522,063,79517,167,602,19917,068,524,00060,973,0002,281,472
3Dec 27, 2025 14:522,065,53217,175,796,62317,076,945,00066,972,0002,281,472
4Dec 27, 2025 14:522,066,20417,182,911,69317,078,528,00070,968,0002,281,472
5Dec 27, 2025 14:522,066,50017,189,371,95717,091,985,00059,968,0002,293,760
6Dec 27, 2025 14:522,066,90817,183,543,52017,088,365,00066,973,0002,281,472
7Dec 27, 2025 14:522,066,93917,194,305,60517,100,624,00054,973,0002,281,472
8Dec 27, 2025 14:522,068,19417,198,882,43717,087,041,00078,967,0002,281,472
9Dec 27, 2025 14:522,068,43917,197,558,07717,102,067,00065,973,0002,293,760