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 26, 2025 20:22hunaphuhunaphuScore: 39,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 20:1938,941347,729,816322,207,0001,000,0002,379,776
2Dec 26, 2025 20:1939,064358,556,096323,233,0001,000,0002,379,776
3Dec 26, 2025 20:1939,116356,724,699322,668,0001,997,0002,383,872
4Dec 26, 2025 20:1939,192348,364,354324,295,0001,000,0002,334,720
5Dec 26, 2025 20:1939,245353,842,030324,734,000999,0002,334,720
6Dec 26, 2025 20:2239,252353,958,747324,789,000999,0002,535,424
7Dec 26, 2025 20:1939,253357,223,680324,802,000999,0002,330,624
8Dec 26, 2025 20:1939,256356,031,046323,829,0001,998,0002,379,776
9Dec 26, 2025 20:2239,257353,004,501324,834,000999,0002,383,872
10Dec 26, 2025 20:1939,263351,739,456323,880,0001,999,0002,379,776
11Dec 26, 2025 20:2239,267359,173,249323,914,0001,999,0002,379,776
12Dec 26, 2025 20:1939,380358,117,015324,858,0001,999,0002,338,816