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 listJun 28, 2025 04:31CCScore: 385,661Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2025 04:31384,4393,220,191,1983,124,866,00065,976,0002,281,472
2Jun 28, 2025 04:31385,2383,225,963,0073,118,516,00078,962,0002,289,664
3Jun 28, 2025 04:31385,4943,229,841,4703,088,649,000110,951,0002,355,200
4Jun 28, 2025 04:31385,6163,230,032,8343,138,639,00061,973,0002,281,472
5Jun 28, 2025 04:31385,6613,229,453,9793,149,016,00051,967,0002,359,296
6Jun 28, 2025 04:31386,0993,232,857,5813,143,645,00060,973,0002,281,472
7Jun 28, 2025 04:31388,4113,247,737,5303,151,836,00071,973,0002,285,568
8Jun 28, 2025 04:31388,9923,253,718,8623,155,664,00072,969,0002,289,664
9Jun 28, 2025 04:31390,9543,272,693,0603,175,967,00068,955,0002,281,472