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 3, 2025 15:00Rajarshi BasuRajarshi BasuScore: 11,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2025 15:0011,619117,020,05395,431,0001,004,0002,289,664
2Dec 3, 2025 15:0011,620122,839,91595,439,0001,004,0002,289,664
3Dec 3, 2025 15:0011,621119,487,69294,442,0002,009,0002,482,176
4Dec 3, 2025 15:0011,624121,221,97695,478,0001,005,0002,289,664
5Dec 3, 2025 15:0011,653125,301,37595,722,000997,0002,289,664
6Dec 3, 2025 15:0011,656126,035,25595,746,000997,0002,289,664
7Dec 3, 2025 15:0011,658129,030,00596,763,00002,289,664
8Dec 3, 2025 15:0011,659122,791,68994,776,0001,995,0002,289,664
9Dec 3, 2025 15:0011,660125,028,91993,783,0002,993,0002,490,368
10Dec 3, 2025 15:0011,862121,524,20398,452,00002,289,664
11Dec 3, 2025 15:0011,863123,466,52297,456,0001,004,0002,490,368
12Dec 3, 2025 15:0011,897123,212,56396,747,0001,994,0002,498,560