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 27, 2025 19:20Oleg KovalovOleg KovalovScore: 56,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 27, 2025 19:2056,934496,978,040471,554,000999,0002,269,184
2Jan 27, 2025 19:2056,950495,555,213471,684,000999,0002,289,664
3Jan 27, 2025 19:2056,954499,189,885470,723,0001,998,0002,289,664
4Jan 27, 2025 19:2056,955496,675,139470,729,0001,998,0002,273,280
5Jan 27, 2025 19:2056,965499,777,479470,808,0001,999,0002,289,664
6Jan 27, 2025 19:2056,965495,184,440470,811,0001,999,0002,289,664
7Jan 27, 2025 19:2056,974498,675,868470,888,0001,999,0002,289,664
8Jan 27, 2025 19:2056,979499,354,151471,925,000999,0002,281,472
9Jan 27, 2025 19:2056,985497,984,473470,976,0001,999,0002,269,184