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 7, 2026 17:56Benn TanBenn TanScore: 33,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 17:5633,619310,131,042278,037,0001,000,0002,449,408
2Feb 7, 2026 17:5633,635305,920,676279,169,00002,478,080
3Feb 7, 2026 17:5633,646312,217,091278,264,0001,000,0002,449,408