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 listNov 5, 2025 12:25caandocaandoScore: 5,672Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 12:255,64873,800,55044,884,0001,994,0002,285,568
2Nov 5, 2025 12:255,64874,064,67344,883,0001,994,0002,285,568
3Nov 5, 2025 12:255,65273,866,59044,918,0001,996,0002,285,568
4Nov 5, 2025 12:255,67269,354,05746,080,0001,001,0002,379,776
5Nov 5, 2025 12:255,76076,400,70247,808,00002,285,568
6Nov 5, 2025 12:255,77771,796,63944,950,0002,996,0002,379,776