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 listJul 6, 2023 11:08Huy Duc LeHuy Duc LeScore: 64,074Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2023 11:0864,052616,317,200531,635,54602,252,800
2Jul 6, 2023 11:0864,074589,209,468531,813,46002,248,704
3Jul 6, 2023 11:0864,081586,715,622531,869,43002,244,608