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 listMay 10, 2026 10:47Josu San MartinJosu San MartinScore: 4,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:484,05547,595,11532,566,0001,097,0002,486,272
2May 10, 2026 10:484,06849,661,20032,729,0001,041,0002,498,560
3May 10, 2026 10:484,08350,050,09132,840,0001,054,0002,478,080
4May 10, 2026 10:484,08451,006,69932,863,0001,042,0002,486,272
5May 10, 2026 10:484,10051,923,87632,988,0001,050,0002,482,176
6May 10, 2026 10:484,11651,615,33933,016,0001,147,0002,478,080
7May 10, 2026 10:484,15652,708,52433,422,0001,076,0002,490,368
8May 10, 2026 10:484,16453,624,52033,500,0001,067,0002,473,984
9May 10, 2026 10:487,66380,967,90062,552,0001,057,0002,486,272