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 21, 2022 04:56Karam Jameel MooreKaram Jameel MooreScore: 1,631,341Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2022 04:561,631,25813,600,818,98013,539,437,27302,260,992
2Jan 21, 2022 04:561,631,34113,600,453,81613,540,133,09602,256,896
3Jan 21, 2022 04:561,636,38313,643,135,90713,581,981,18402,260,992