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 9, 2025 03:06Ian MckibbenIan MckibbenScore: 51,317Success
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:1344,139388,589,158366,356,00002,289,664
2Jan 11, 2025 07:1344,160391,206,696364,535,0001,997,0002,289,664
3Jan 11, 2025 07:1344,171402,016,623365,623,000998,0002,289,664
4Jan 9, 2025 03:0651,317455,206,310424,932,000999,0002,289,664
5Jan 9, 2025 03:0651,437450,231,292424,924,0001,999,0002,289,664
6Jan 9, 2025 03:0651,477450,679,166426,261,0001,000,0002,273,280