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 13, 2024 03:07bgimby-nsbgimby-nsScore: 470,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2024 03:07470,6673,973,929,4803,906,539,83802,244,608
2Jul 13, 2024 03:07470,7313,969,988,8113,907,065,48502,244,608
3Jul 13, 2024 03:07475,4634,011,797,6163,946,340,56302,240,512