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 19, 2026 17:06Daniel MastalerzDaniel MastalerzScore: 10,052Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 17:069,852112,677,52280,778,000997,0002,289,664
2Feb 19, 2026 17:069,855109,949,14480,802,000997,0002,289,664
3Feb 19, 2026 17:069,857110,133,10780,813,000997,0002,519,040
4Feb 19, 2026 17:0610,052107,208,19382,428,0001,005,0002,265,088
5Feb 19, 2026 17:0610,057107,836,42282,467,0001,005,0002,273,280
6Feb 19, 2026 17:0610,068111,900,62682,560,0001,006,0002,289,664