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 4, 2025 17:53caandocaandoScore: 5,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 17:535,84975,805,37147,533,0001,011,0002,285,568
2Nov 4, 2025 17:535,87976,424,85747,801,000995,0002,277,376
3Nov 4, 2025 17:535,91676,461,73147,097,0002,004,0002,285,568
4Nov 4, 2025 17:535,92575,446,34247,172,0002,007,0002,285,568
5Nov 4, 2025 17:535,96072,412,42148,459,0001,009,0002,285,568
6Nov 4, 2025 17:536,06976,131,18749,366,0001,007,0002,265,088