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 listAug 2, 2022 12:39Elvir CrnčevićElvir CrnčevićScore: 450,270Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 12:39450,1463,811,135,7503,736,209,66902,248,704
2Aug 2, 2022 12:39450,2703,795,093,8593,737,237,23202,236,416
3Aug 2, 2022 12:39453,0203,835,157,0713,760,069,42302,244,608