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 14, 2026 01:38Victor MerckléVictor MerckléScore: 7,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 01:387,28269,665,50060,448,00002,113,536
2May 14, 2026 01:387,29268,547,58559,526,0001,001,0002,113,536
3May 14, 2026 01:387,29469,773,25959,531,0001,015,0002,113,536
4May 14, 2026 01:387,29770,086,78959,519,0001,053,0002,113,536
5May 14, 2026 01:387,29869,989,16559,559,0001,022,0002,113,536
6May 14, 2026 01:387,30367,960,18759,544,0001,079,0002,113,536
7May 14, 2026 01:387,34169,543,80160,937,00002,113,536
8May 14, 2026 01:387,34970,321,98259,958,0001,044,0002,113,536
9May 14, 2026 01:387,36469,103,94760,089,0001,039,0002,113,536