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 listAug 18, 2025 22:43Leon ZhaoLeon ZhaoScore: 11,688Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 22:4311,561125,697,89993,961,0001,999,0002,469,888
2Aug 18, 2025 22:4311,567119,214,47495,010,0001,000,0002,318,336
3Aug 18, 2025 22:4311,571120,549,84494,036,0002,000,0002,285,568
4Aug 18, 2025 22:4311,688117,870,97495,007,0002,000,0002,318,336
5Aug 18, 2025 22:4311,692126,444,98496,042,0001,000,0002,285,568
6Aug 18, 2025 22:4311,697123,260,88495,086,0002,001,0002,285,568