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 listDec 4, 2025 13:27Rajarshi BasuRajarshi BasuScore: 8,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 13:278,24898,689,64068,455,00002,486,272
2Dec 4, 2025 13:278,24892,622,72767,454,0001,006,0002,289,664
3Dec 4, 2025 13:278,25191,596,64368,481,00002,289,664
4Dec 4, 2025 13:278,25293,046,15268,493,00002,289,664
5Dec 4, 2025 13:278,25594,489,23767,508,0001,007,0002,289,664
6Dec 4, 2025 13:278,26197,296,43167,559,0001,008,0002,342,912
7Dec 4, 2025 13:278,26295,142,75367,568,0001,008,0002,494,464
8Dec 4, 2025 13:278,26693,996,92067,597,0001,008,0002,490,368
9Dec 4, 2025 13:278,26993,750,10667,621,0001,009,0002,490,368
10Dec 4, 2025 13:278,44396,341,41668,075,0002,002,0002,486,272
11Dec 4, 2025 13:278,44793,920,59268,108,0002,003,0002,289,664
12Dec 4, 2025 13:278,45093,878,30468,131,0002,003,0002,289,664