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 11, 2025 07:21Ian MckibbenIan MckibbenScore: 44,169Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 07:2144,152393,705,859365,462,0001,001,0002,281,472
2Jan 11, 2025 07:2144,169396,202,550365,601,000998,0002,289,664
3Jan 11, 2025 07:2144,197391,235,517364,840,0001,999,0002,269,184