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 6, 2025 10:42Rajarshi BasuRajarshi BasuScore: 6,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 10:426,89880,082,67855,247,0002,009,0002,273,280
2Dec 6, 2025 10:426,90079,652,24955,262,0002,009,0002,265,088
3Dec 6, 2025 10:426,91884,270,30156,416,0001,007,0002,289,664
4Dec 6, 2025 10:426,92187,212,44355,428,0002,015,0002,289,664
5Dec 6, 2025 10:426,94085,233,90056,591,0001,010,0002,265,088
6Dec 6, 2025 10:426,94985,365,59457,673,00002,269,184
7Dec 6, 2025 10:426,96687,883,17355,823,0001,993,0002,285,568
8Dec 6, 2025 10:427,02386,475,28356,282,0002,010,0002,519,040
9Dec 6, 2025 10:427,06290,170,50057,604,0001,010,0002,289,664
10Dec 6, 2025 10:427,08488,589,74257,804,000996,0002,269,184
11Dec 6, 2025 10:427,08582,484,70156,811,0001,993,0002,273,280
12Dec 6, 2025 10:427,18487,571,82858,619,0001,010,0002,289,664