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 listJan 29, 2025 21:16KeefeKeefeScore: 57,063Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2025 21:1756,958503,419,557468,754,0003,997,0002,277,376
2Jan 29, 2025 21:1656,984496,816,029469,968,0002,999,0002,277,376
3Jan 29, 2025 21:1757,016495,720,106473,232,00002,519,040
4Jan 29, 2025 21:1657,063499,289,709471,628,0001,998,0002,379,776
5Jan 29, 2025 21:1757,129506,394,248473,172,0001,000,0002,277,376
6Jan 29, 2025 21:1657,228505,904,143472,991,0001,999,0002,277,376