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 7, 2026 10:25wnwnScore: 3,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:263,37444,298,07026,955,0001,050,0002,482,176
2May 7, 2026 10:263,37544,461,67526,956,0001,064,0002,490,368
3May 7, 2026 10:263,37541,498,22426,956,0001,062,0002,490,368
4May 7, 2026 10:263,38743,836,02427,044,0001,072,0002,498,560
5May 7, 2026 10:263,39243,386,70027,082,0001,076,0002,482,176
6May 7, 2026 10:263,39544,111,08327,106,0001,075,0002,494,464
7May 7, 2026 10:263,41644,661,73527,253,0001,101,0002,490,368
8May 7, 2026 10:263,53644,154,73328,251,0001,101,0002,486,272
9May 7, 2026 10:263,54946,144,21028,377,0001,084,0002,486,272