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 listOct 20, 2024 18:58Vladimir TatVladimir TatScore: 54,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2024 18:5854,260472,937,155449,361,0001,000,0002,375,680
2Oct 20, 2024 18:5854,268478,721,791449,422,0001,000,0002,281,472
3Oct 20, 2024 18:5854,271479,975,804449,448,0001,000,0002,523,136
4Oct 20, 2024 18:5854,292477,547,212448,626,0001,998,0002,281,472
5Oct 20, 2024 18:5854,293474,237,676448,631,0001,998,0002,289,664
6Oct 20, 2024 18:5854,293476,416,815448,637,0001,998,0002,289,664
7Oct 20, 2024 18:5854,294479,656,523448,643,0001,998,0002,289,664
8Oct 20, 2024 18:5854,295476,519,856448,648,0001,998,0002,289,664
9Oct 20, 2024 18:5854,298473,686,411449,672,0001,001,0002,289,664