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 listOct 6, 2025 16:37wnwnScore: 47,779Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2025 16:3747,766423,159,996396,457,00002,379,776
2Oct 6, 2025 16:3747,773422,368,377395,517,000998,0002,273,280
3Oct 6, 2025 16:3747,777427,612,979394,551,0001,997,0002,289,664
4Oct 6, 2025 16:3747,778426,402,555394,558,0001,997,0002,289,664
5Oct 6, 2025 16:3747,779421,803,994395,565,000998,0002,289,664
6Oct 6, 2025 16:3747,785426,960,899394,620,0001,998,0002,281,472
7Oct 6, 2025 16:3747,786417,516,670395,626,000999,0002,289,664
8Oct 6, 2025 16:3747,786426,187,325395,623,000999,0002,273,280
9Oct 6, 2025 16:3747,819417,895,711394,901,0001,999,0002,273,280