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 22, 2025 21:05Miriam VellacottMiriam VellacottScore: 389,851Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 21:05387,1943,242,000,3853,158,748,00054,960,0002,281,472
2Jan 22, 2025 21:05387,3903,242,499,4533,157,368,00057,970,0002,281,472
3Jan 22, 2025 21:05387,6753,242,410,4543,141,733,00075,969,0002,289,664
4Jan 22, 2025 21:05388,4243,252,268,4743,160,960,00062,959,0002,281,472
5Jan 22, 2025 21:05389,8513,265,606,4433,154,819,00080,944,0002,359,296
6Jan 22, 2025 21:05390,0693,260,955,9583,168,606,00068,969,0002,363,392
7Jan 22, 2025 21:05390,5043,268,317,8043,173,222,00067,961,0002,363,392
8Jan 22, 2025 21:05391,3443,276,641,6093,188,193,00059,966,0002,281,472
9Jan 22, 2025 21:05432,7683,621,028,8593,524,017,00067,961,0002,289,664