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 29, 2025 22:40Rajarshi BasuRajarshi BasuScore: 16,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2025 22:4016,087160,223,385132,517,0001,003,0002,289,664
2Nov 29, 2025 22:4016,090158,639,459133,551,00002,269,184
3Nov 29, 2025 22:4016,093157,073,298132,567,0001,004,0002,375,680
4Nov 29, 2025 22:4016,110161,364,279131,715,0001,995,0002,289,664
5Nov 29, 2025 22:4016,121160,057,266132,806,000998,0002,265,088
6Nov 29, 2025 22:4016,123158,822,758131,824,0001,997,0002,289,664
7Nov 29, 2025 22:4016,127158,502,043132,858,000998,0002,289,664
8Nov 29, 2025 22:4016,127159,078,336131,857,0001,997,0002,269,184
9Nov 29, 2025 22:4016,134160,154,090131,915,0001,998,0002,289,664