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 1, 2026 22:21TonyTonyScore: 41,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 22:2141,944356,723,369347,133,0001,004,0002,117,632
2Aug 1, 2026 22:2141,958356,536,495347,251,0001,004,0002,117,632
3Aug 1, 2026 22:2141,962357,517,528347,287,0001,003,0002,117,632
4Aug 1, 2026 22:2141,972356,928,284347,367,0001,005,0002,117,632
5Aug 1, 2026 22:2141,973357,594,650347,379,0001,004,0002,117,632
6Aug 1, 2026 22:2141,975358,554,526347,397,0001,003,0002,117,632
7Aug 1, 2026 22:2141,985357,765,284347,476,0001,004,0002,117,632
8Aug 1, 2026 22:2141,997357,130,251347,575,0001,005,0002,117,632
9Aug 1, 2026 22:2142,001357,920,038347,610,0001,003,0002,117,632