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 listSep 29, 2026 09:49wnwnScore: 3,304Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 09:493,27236,050,51327,160,000020,480
2Sep 29, 2026 09:493,27936,052,14827,223,000020,480
3Sep 29, 2026 09:493,28536,151,82627,266,000020,480
4Sep 29, 2026 09:493,28936,197,13627,304,000020,480
5Sep 29, 2026 09:493,30436,266,58427,426,000020,480
6Sep 29, 2026 09:493,37236,827,14527,991,000020,480
7Sep 29, 2026 09:493,47137,677,26228,816,000020,480
8Sep 29, 2026 09:493,47837,744,52428,872,000020,480
9Sep 29, 2026 09:493,48938,424,38428,963,000020,480