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 19, 2022 09:16spire-ffostonspire-ffostonScore: 360,940Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2022 09:16358,7133,041,072,2622,977,317,44802,203,648
2Jul 19, 2022 09:16360,9403,056,531,5802,995,798,93402,203,648
3Jul 19, 2022 09:16367,0983,122,605,8863,046,913,46802,191,360