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 16, 2026 19:11wnwnScore: 8,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 19:117,35483,734,66956,039,0005,003,0002,367,488
2Feb 16, 2026 19:117,36588,296,62458,127,0003,006,0002,351,104
3Feb 16, 2026 19:117,39186,158,30058,331,0003,017,0002,326,528
4Feb 16, 2026 19:118,41699,025,41564,861,0004,989,0002,457,600
5Feb 16, 2026 19:118,43896,066,32467,034,0003,001,0002,347,008
6Feb 16, 2026 19:118,55295,718,88366,985,0003,999,0002,342,912