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 listFeb 14, 2026 12:55Juraj ZelmanJuraj ZelmanScore: 61,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2026 12:5561,497541,116,104509,421,0001,000,0002,367,488
2Feb 14, 2026 12:5561,554538,240,868508,898,0001,999,0002,289,664
3Feb 14, 2026 12:5561,556533,770,163509,913,000999,0002,285,568
4Feb 14, 2026 12:5561,617536,064,007510,423,0001,000,0002,371,584
5Feb 14, 2026 12:5561,643540,325,085510,637,000999,0002,293,760
6Feb 14, 2026 12:5561,692535,095,321511,045,0001,000,0002,355,200
7Feb 14, 2026 12:5561,759544,713,157510,598,0001,998,0002,293,760
8Feb 14, 2026 12:5561,783539,795,663510,797,0001,999,0002,289,664
9Feb 14, 2026 12:5561,807537,208,687511,000,0002,000,0002,371,584