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 11:55KeefeKeefeScore: 62,517Success
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 11:5562,408543,839,019516,984,000999,0002,277,376
2Jan 29, 2025 11:5562,485547,685,596516,628,0001,998,0002,273,280
3Jan 29, 2025 11:5562,504544,366,115516,785,0001,999,0002,371,584
4Jan 29, 2025 11:5562,510551,197,884517,832,000999,0002,281,472
5Jan 29, 2025 11:5562,517545,975,841515,892,0002,999,0002,289,664
6Jan 29, 2025 11:5562,524541,992,340516,951,0001,999,0002,281,472
7Jan 29, 2025 11:5562,531546,848,451516,005,0003,000,0002,277,376
8Jan 29, 2025 11:5562,535540,491,810516,040,0003,000,0002,273,280
9Jan 29, 2025 11:5562,563545,342,276517,276,0002,001,0002,273,280