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 listSep 27, 2025 06:42sheryllynn24sheryllynn24Score: 6,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2025 06:426,33078,817,06951,528,0001,010,0002,359,296
2Sep 27, 2025 06:426,33277,872,45151,545,0001,010,0002,289,664
3Sep 27, 2025 06:426,33379,201,57751,557,0001,010,0002,289,664
4Sep 27, 2025 06:426,33578,466,78351,572,0001,011,0002,289,664
5Sep 27, 2025 06:426,33880,532,11851,596,0001,011,0002,523,136
6Sep 27, 2025 06:426,34379,318,69951,632,0001,012,0002,289,664
7Sep 27, 2025 06:426,35084,691,22850,716,0001,988,0002,523,136
8Sep 27, 2025 06:426,36480,485,19451,826,000996,0002,281,472
9Sep 27, 2025 06:426,45879,222,10452,594,0001,011,0002,269,184
10Sep 27, 2025 06:426,48379,978,02652,810,000996,0002,269,184
11Sep 27, 2025 06:426,48779,281,94751,852,0001,994,0002,523,136
12Sep 27, 2025 06:426,92985,127,42555,494,0002,017,0002,269,184