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 listMay 15, 2026 01:45Victor MerckléVictor MerckléScore: 7,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 01:467,23969,252,33559,080,0001,004,0002,113,536
2May 15, 2026 01:467,23967,667,30459,086,0001,000,0002,113,536
3May 15, 2026 01:467,23970,178,89460,085,00002,113,536
4May 15, 2026 01:467,24168,674,69560,104,00002,113,536
5May 15, 2026 01:467,24167,415,91560,104,00002,113,536
6May 15, 2026 01:467,29469,978,74360,543,00002,113,536
7May 15, 2026 01:467,29670,766,68660,558,00002,113,536
8May 15, 2026 01:467,29767,854,80060,573,00002,113,536
9May 15, 2026 01:467,37569,570,71860,211,0001,006,0002,113,536